Search alternatives:
pinnae » pinna (Expand Search), pinnau (Expand Search), pinnacle (Expand Search), pingnae (Expand Search), spinnae (Expand Search)
spinned » spanned (Expand Search), pinned (Expand Search), skinned (Expand Search), spingned (Expand Search), sspinned (Expand Search)
pinka » pink (Expand Search), pinna (Expand Search), linka (Expand Search), pingka (Expand Search), spinka (Expand Search)
pina » ping (Expand Search), aina (Expand Search), nina (Expand Search), pinga (Expand Search), spina (Expand Search)
bina » bin (Expand Search), bing (Expand Search)
peng » eng (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
pinnae » pinna (Expand Search), pinnau (Expand Search), pinnacle (Expand Search), pingnae (Expand Search), spinnae (Expand Search)
spinned » spanned (Expand Search), pinned (Expand Search), skinned (Expand Search), spingned (Expand Search), sspinned (Expand Search)
pinka » pink (Expand Search), pinna (Expand Search), linka (Expand Search), pingka (Expand Search), spinka (Expand Search)
pina » ping (Expand Search), aina (Expand Search), nina (Expand Search), pinga (Expand Search), spina (Expand Search)
bina » bin (Expand Search), bing (Expand Search)
peng » eng (Expand Search)
pin » ping (Expand Search), spin (Expand Search)
-
201
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
202
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
203
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
204
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
205
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
206
-
207
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 -
208
Patterned surface with controllable wettability for inkjet printing of flexible printed electronics
Published 2014Get full text
Get full text
Journal Article -
209
Metasurface-tunable lasing polarizations in a microcavity
Published 2023Get full text
Journal Article -
210
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article -
211
-
212
-
213
-
214
-
215
Health and disease phenotyping in old age using a cluster network analysis
Published 2018Get full text
Get full text
Journal Article -
216
-
217
Bagan Mural project : building a robust digital library on Wordpress
Published 2014Get full text
Get full text
Get full text
Conference Paper -
218
-
219
Short-term load forecasting by wavelet transform and evolutionary extreme learning machine
Published 2015Get full text
Get full text
Get full text
Journal Article -
220
Reliability- and cost-based redundancy design for modular multilevel converter
Published 2020Get full text
Journal Article