Search alternatives:
pinna » pina (Expand Search), pinga (Expand Search), pinaa (Expand Search)
pinn » ping (Expand Search), pin (Expand Search), pina (Expand Search)
pinge » ping (Expand Search), hinge (Expand Search), pine (Expand Search)
aina » ainaa (Expand Search), bina (Expand Search), anna (Expand Search)
ling » long (Expand Search), line (Expand Search), link (Expand Search)
peng » eng (Expand Search)
pinna » pina (Expand Search), pinga (Expand Search), pinaa (Expand Search)
pinn » ping (Expand Search), pin (Expand Search), pina (Expand Search)
pinge » ping (Expand Search), hinge (Expand Search), pine (Expand Search)
aina » ainaa (Expand Search), bina (Expand Search), anna (Expand Search)
ling » long (Expand Search), line (Expand Search), link (Expand Search)
peng » eng (Expand Search)
-
181
-
182
-
183
-
184
Optimisation of microwave drying for encapsulation of edible bird’s nest hydrolysate.
Published 2022Get full text
Conference or Workshop Item -
185
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
186
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
187
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
188
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
189
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
190
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
191
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
192
-
193
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 -
194
-
195
Understanding domestic constraints on international trade negotiations : case of US-China trade war
Published 2020Get full text
Final Year Project (FYP) -
196
-
197
-
198
Image processing algorithms for medical applications
Published 2021Get full text
Final Year Project (FYP) -
199
-
200