Search alternatives:
spinae » spinal (Expand Search), spine (Expand Search), shinae (Expand Search)
espina » espinar (Expand Search), espana (Expand Search), spina (Expand Search)
pine » spine (Expand Search), line (Expand Search), fine (Expand Search)
spie » spin (Expand Search)
bing » ling (Expand Search), ming (Expand Search), ying (Expand Search)
pingna » pinna (Expand Search)
spinna » pinna (Expand Search), spina (Expand Search)
peng » eng (Expand Search)
spinae » spinal (Expand Search), spine (Expand Search), shinae (Expand Search)
espina » espinar (Expand Search), espana (Expand Search), spina (Expand Search)
pine » spine (Expand Search), line (Expand Search), fine (Expand Search)
spie » spin (Expand Search)
bing » ling (Expand Search), ming (Expand Search), ying (Expand Search)
pingna » pinna (Expand Search)
spinna » pinna (Expand Search), spina (Expand Search)
peng » eng (Expand Search)
-
141
Best IT practices : knowledge-based logistics management and implementation.
Published 2008Get full text
Final Year Project (FYP) -
142
-
143
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
144
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
145
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
146
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
147
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
148
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
149
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
150
-
151
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 -
152
Dielectric dynamics of epitaxial BiFeO3 thin films
Published 2013Get full text
Get full text
Journal Article -
153
-
154
Toward achieving robust low-level and high-level scene parsing
Published 2020Get full text
Journal Article -
155
A CFD-sectional algorithm for population balance equation coupled with multi-dimensional flow dynamics
Published 2021Get full text
Journal Article -
156
The function of pitching in Beetle's flight revealed by insect-wearable backpack
Published 2022Get full text
Journal Article -
157
Probabilistic classification criterion for failure modes of reinforced concrete columns
Published 2022Get full text
Journal Article -
158
-
159
-
160