Search alternatives:
pinnau » pinna (Expand Search), pinnae (Expand Search), pingnau (Expand Search), spinnau (Expand Search)
pinaae » pinnae (Expand Search), pingaae (Expand Search), spinaae (Expand Search)
shinae » shine (Expand Search), shina (Expand Search), shinde (Expand Search)
ince » since (Expand Search), vince (Expand Search), inche (Expand Search)
spengge » spengler (Expand Search), sengge (Expand Search)
line » like (Expand Search), life (Expand Search)
peng » eng (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
ming » min (Expand Search), ling (Expand Search)
pinnau » pinna (Expand Search), pinnae (Expand Search), pingnau (Expand Search), spinnau (Expand Search)
pinaae » pinnae (Expand Search), pingaae (Expand Search), spinaae (Expand Search)
shinae » shine (Expand Search), shina (Expand Search), shinde (Expand Search)
ince » since (Expand Search), vince (Expand Search), inche (Expand Search)
spengge » spengler (Expand Search), sengge (Expand Search)
line » like (Expand Search), life (Expand Search)
peng » eng (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
ming » min (Expand Search), ling (Expand Search)
-
421
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
422
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
423
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
424
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
425
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
426
-
427
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 -
428
Patterned surface with controllable wettability for inkjet printing of flexible printed electronics
Published 2014Get full text
Get full text
Journal Article -
429
Metasurface-tunable lasing polarizations in a microcavity
Published 2023Get full text
Journal Article -
430
Understanding organic solvent permeation during nanofiltration via electrical impedance spectroscopy (EIS)
Published 2024Get full text
Journal Article -
431
-
432
Health and disease phenotyping in old age using a cluster network analysis
Published 2018Get full text
Get full text
Journal Article -
433
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article -
434
-
435
-
436
-
437
Degradation model of a linear-mode LED driver and its application in lifetime prediction
Published 2015Get full text
Get full text
Journal Article -
438
Localization and velocity tracking of human via 3 IMU sensors
Published 2016Get full text
Get full text
Journal Article -
439
Excitonic properties of graphene-based materials
Published 2013Get full text
Get full text
Journal Article -
440