Search alternatives:
pinn » ping (Expand Search), pina (Expand Search), pink (Expand Search), pingn (Expand Search), spinn (Expand Search)
spinnae » spingae (Expand Search), spinaae (Expand Search), spinkae (Expand Search), pinnae (Expand Search), spinae (Expand Search), spingnae (Expand Search), sspinnae (Expand Search)
spie » spin (Expand Search)
ming » min (Expand Search), ling (Expand Search)
peng » eng (Expand Search)
pingge » jingge (Expand Search), qingge (Expand Search), xingge (Expand Search), pinggge (Expand Search), spingge (Expand Search)
hing » ching (Expand Search), shing (Expand Search), hiang (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
pinn » ping (Expand Search), pina (Expand Search), pink (Expand Search), pingn (Expand Search), spinn (Expand Search)
spinnae » spingae (Expand Search), spinaae (Expand Search), spinkae (Expand Search), pinnae (Expand Search), spinae (Expand Search), spingnae (Expand Search), sspinnae (Expand Search)
spie » spin (Expand Search)
ming » min (Expand Search), ling (Expand Search)
peng » eng (Expand Search)
pingge » jingge (Expand Search), qingge (Expand Search), xingge (Expand Search), pinggge (Expand Search), spingge (Expand Search)
hing » ching (Expand Search), shing (Expand Search), hiang (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
-
281
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
282
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
283
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
284
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
285
-
286
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 -
287
Patterned surface with controllable wettability for inkjet printing of flexible printed electronics
Published 2014Get full text
Get full text
Journal Article -
288
Metasurface-tunable lasing polarizations in a microcavity
Published 2023Get full text
Journal Article -
289
Understanding organic solvent permeation during nanofiltration via electrical impedance spectroscopy (EIS)
Published 2024Get full text
Journal Article -
290
-
291
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article -
292
-
293
3D simulation-based research on the effect of interconnect structures on circuit reliability
Published 2015Get full text
Get full text
Get full text
Journal Article -
294
-
295
-
296
Degradation model of a linear-mode LED driver and its application in lifetime prediction
Published 2015Get full text
Get full text
Journal Article -
297
Localization and velocity tracking of human via 3 IMU sensors
Published 2016Get full text
Get full text
Journal Article -
298
Excitonic properties of graphene-based materials
Published 2013Get full text
Get full text
Journal Article -
299
Health and disease phenotyping in old age using a cluster network analysis
Published 2018Get full text
Get full text
Journal Article -
300