Search alternatives:
spin » sping (Expand Search)
pin » ping (Expand Search)
pink » pingk (Expand Search), link (Expand Search), ping (Expand Search), pick (Expand Search)
spinal » spingal (Expand Search)
pinna » pingna (Expand Search), pina (Expand Search), pinn (Expand Search)
sink » link (Expand Search), sin (Expand Search), sing (Expand Search)
peng » eng (Expand Search)
spin » sping (Expand Search)
pin » ping (Expand Search)
pink » pingk (Expand Search), link (Expand Search), ping (Expand Search), pick (Expand Search)
spinal » spingal (Expand Search)
pinna » pingna (Expand Search), pina (Expand Search), pinn (Expand Search)
sink » link (Expand Search), sin (Expand Search), sing (Expand Search)
peng » eng (Expand Search)
-
341
Development of a device-free fall detection system in home environment
Published 2018Get full text
Final Year Project (FYP) -
342
-
343
One level density of low-lying zeros of families of L-functions
Published 2011Get full text
Get full text
Journal Article -
344
-
345
-
346
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
347
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
348
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
349
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
350
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
351
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
352
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
353
-
354
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 -
355
Patterned surface with controllable wettability for inkjet printing of flexible printed electronics
Published 2014Get full text
Get full text
Journal Article -
356
Metasurface-tunable lasing polarizations in a microcavity
Published 2023Get full text
Journal Article -
357
-
358
-
359
4.500 Introduction to Design Computing, Spring 2006
Published 2006Subjects: Get full text
Learning Object -
360
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article