-
221
One level density of low-lying zeros of families of L-functions
Published 2011Get full text
Get full text
Journal Article -
222
Longitudinal coupling effect in microfiber Bragg gratings
Published 2013Get full text
Get full text
Journal Article -
223
Bridging the digital divide: promoting equal access to online learning for health professions in an unequal world
Published 2024Get full text
Journal Article -
224
-
225
Romantic crushes promote variety-seeking behavior
Published 2019Get full text
Get full text
Journal Article -
226
A planar antenna in LTCC for single-package ultrawide-band radio
Published 2009Get full text
Get full text
Journal Article -
227
A microstrip grid array antenna for 60-GHz applications
Published 2013Get full text
Get full text
Conference Paper -
228
-
229
-
230
Probabilistic estimation of plug-in electric vehicles charging load profile
Published 2015Get full text
Get full text
Journal Article -
231
Energy disaggregation of overlapping home appliances consumptions using a cluster splitting approach
Published 2020Get full text
Journal Article -
232
An unsupervised Bayesian neural network for truth discovery in social networks
Published 2021Get full text
Journal Article -
233
A Hilbert space theory of generalized graph signal processing
Published 2021Get full text
Journal Article -
234
Wide-sense stationarity and spectral estimation for generalized graph signal
Published 2022Get full text
Conference Paper -
235
360 Immersive VR website for experiencing Singapore
Published 2017Get full text
Final Year Project (FYP) -
236
Tensor decomposition based R-dimensional matrix pencil method
Published 2012Get full text
Get full text
Get full text
Conference Paper -
237
-
238
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 -
239
-
240