Search alternatives:
pingna » pinna (Expand Search)
sspinned » spanned (Expand Search), pinned (Expand Search), skinned (Expand Search)
fine » find (Expand Search), line (Expand Search), five (Expand Search)
spine » spin (Expand Search), spie (Expand Search), spike (Expand Search)
peng » eng (Expand Search)
pingna » pinna (Expand Search)
sspinned » spanned (Expand Search), pinned (Expand Search), skinned (Expand Search)
fine » find (Expand Search), line (Expand Search), five (Expand Search)
spine » spin (Expand Search), spie (Expand Search), spike (Expand Search)
peng » eng (Expand Search)
-
121
Development of a device-free fall detection system in home environment
Published 2018Get full text
Final Year Project (FYP) -
122
-
123
One level density of low-lying zeros of families of L-functions
Published 2011Get full text
Get full text
Journal Article -
124
Observations of Double Diffusive Staircase Edges in the Arctic Ocean
Published 2024Get full text
Article -
125
-
126
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
127
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
128
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
129
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
130
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
131
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
132
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
133
-
134
On the edge‐toughness of a graph. II
Published 1993“…We also give a simpler proof to the following result of Peng et al.: For any positive integers r, s satisfying r/2 < s ≤ r, there exists an infinite family of graphs such that for each graph G in the family, λ(G) = r (where λ(G) is the edge‐connectivity of G) T1(G) = s, and G can be factored into s spanning trees.…”
Article -
135
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article -
136
-
137
-
138
Bagan Mural project : building a robust digital library on Wordpress
Published 2014Get full text
Get full text
Get full text
Conference Paper -
139
-
140
Short-term load forecasting by wavelet transform and evolutionary extreme learning machine
Published 2015Get full text
Get full text
Get full text
Journal Article