Search alternatives:
pin » ping (Expand Search), spin (Expand Search)
pine » pinge (Expand Search), spine (Expand Search), line (Expand Search), fine (Expand Search)
pinge » pingge (Expand Search), spinge (Expand Search), ping (Expand Search), hinge (Expand Search), inge (Expand Search)
chin » china (Expand Search), chain (Expand Search), chian (Expand Search)
spike » spie (Expand Search)
sline » line (Expand Search), spine (Expand Search), slice (Expand Search)
peng » eng (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
pine » pinge (Expand Search), spine (Expand Search), line (Expand Search), fine (Expand Search)
pinge » pingge (Expand Search), spinge (Expand Search), ping (Expand Search), hinge (Expand Search), inge (Expand Search)
chin » china (Expand Search), chain (Expand Search), chian (Expand Search)
spike » spie (Expand Search)
sline » line (Expand Search), spine (Expand Search), slice (Expand Search)
peng » eng (Expand Search)
-
261
-
262
-
263
-
264
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
265
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
266
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
267
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
268
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
269
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
270
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
271
-
272
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 -
273
Patterned surface with controllable wettability for inkjet printing of flexible printed electronics
Published 2014Get full text
Get full text
Journal Article -
274
Metasurface-tunable lasing polarizations in a microcavity
Published 2023Get full text
Journal Article -
275
-
276
-
277
-
278
-
279
“Clicking” compliant mechanism for flapping-wing micro aerial vehicle
Published 2013Get full text
Get full text
Conference Paper -
280
The trend of life insurance industry in selected asian emerging economies.
Published 2008Get full text
Final Year Project (FYP)