Search alternatives:
spinnae » pinnae (Expand Search), spinae (Expand Search), spingae (Expand Search), spinaae (Expand Search)
line » like (Expand Search), life (Expand Search)
swing » owing (Expand Search), wing (Expand Search), shing (Expand Search)
pinn » ping (Expand Search), pin (Expand Search), pina (Expand Search)
peng » eng (Expand Search)
pengat » engat (Expand Search), penguat (Expand Search), pingat (Expand Search), pangat (Expand Search)
ling » long (Expand Search), link (Expand Search), lin (Expand Search)
spinnae » pinnae (Expand Search), spinae (Expand Search), spingae (Expand Search), spinaae (Expand Search)
line » like (Expand Search), life (Expand Search)
swing » owing (Expand Search), wing (Expand Search), shing (Expand Search)
pinn » ping (Expand Search), pin (Expand Search), pina (Expand Search)
peng » eng (Expand Search)
pengat » engat (Expand Search), penguat (Expand Search), pingat (Expand Search), pangat (Expand Search)
ling » long (Expand Search), link (Expand Search), lin (Expand Search)
-
321
-
322
-
323
-
324
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
325
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
326
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
327
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
328
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
329
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
330
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
331
-
332
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 -
333
Understanding domestic constraints on international trade negotiations : case of US-China trade war
Published 2020Get full text
Final Year Project (FYP) -
334
-
335
-
336
Image processing algorithms for medical applications
Published 2021Get full text
Final Year Project (FYP) -
337
-
338
-
339
Travel-based multitasking behaviour and autonomous vehicle design
Published 2022Get full text
Final Year Project (FYP) -
340
Opportunities and challenges of green logistics in Singapore
Published 2022Get full text
Final Year Project (FYP)