Search alternatives:
pinnae » pinna (Expand Search), pinnau (Expand Search), pinnacle (Expand Search)
line » like (Expand Search), life (Expand Search)
spinggge » spingge (Expand Search), shinggge (Expand Search), swinggge (Expand Search)
sping » spin (Expand Search), shing (Expand Search), swing (Expand Search)
pina » ping (Expand Search), pin (Expand Search), bina (Expand Search)
nina » nine (Expand Search), ning (Expand Search), bina (Expand Search)
peng » eng (Expand Search)
pinnae » pinna (Expand Search), pinnau (Expand Search), pinnacle (Expand Search)
line » like (Expand Search), life (Expand Search)
spinggge » spingge (Expand Search), shinggge (Expand Search), swinggge (Expand Search)
sping » spin (Expand Search), shing (Expand Search), swing (Expand Search)
pina » ping (Expand Search), pin (Expand Search), bina (Expand Search)
nina » nine (Expand Search), ning (Expand Search), bina (Expand Search)
peng » eng (Expand Search)
-
461
-
462
-
463
-
464
-
465
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
466
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
467
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
468
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
469
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
470
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
471
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
472
-
473
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 -
474
-
475
-
476
Polymeric nonviral gene delivery systems for cancer immunotherapy
Published 2020Get full text
Journal Article -
477
Plant-based amyloids from food waste for removal of heavy metals from contaminated water
Published 2022Get full text
Journal Article -
478
Flow-through electrochemically assisted reverse-osmosis: a new process towards low-chemical desalination
Published 2024Get full text
Journal Article -
479
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article -
480