736 search results - page 110 / 148 » Distinguishing geometric graphs |
168
click to vote
INFOCOM
2008
IEEE
16 years 7 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
162
click to vote
GLOBECOM
2007
IEEE
16 years 5 days ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
155
click to vote
INFOCOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
166
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
172
click to vote
MSWIM
2004
ACM
15 years 11 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...