Search alternatives:
spintu » pintu (Expand Search)
spingr » spinor (Expand Search)
pinna » pinn (Expand Search)
pina » ping (Expand Search), pin (Expand Search), bina (Expand Search)
peng » eng (Expand Search)
spintu » pintu (Expand Search)
spingr » spinor (Expand Search)
pinna » pinn (Expand Search)
pina » ping (Expand Search), pin (Expand Search), bina (Expand Search)
peng » eng (Expand Search)
-
201
-
202
-
203
-
204
-
205
Development of a device-free fall detection system in home environment
Published 2018Get full text
Final Year Project (FYP) -
206
-
207
One level density of low-lying zeros of families of L-functions
Published 2011Get full text
Get full text
Journal Article -
208
360 Immersive VR website for experiencing Singapore
Published 2017“…Building such a platform is akin to having a first glimpse of how websites of today would look like in VR. The platform would also challenge the definition of VR, as with WebVR, high powered head mounted displays (HMDs) becomes an optional accessory to enhance the experience; it is not compulsory. …”
Get full text
Final Year Project (FYP) -
209
-
210
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
211
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
212
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
213
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
214
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
215
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
216
-
217
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 -
218
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article -
219
-
220
Bagan Mural project : building a robust digital library on Wordpress
Published 2014Get full text
Get full text
Get full text
Conference Paper