Sciweavers

525 search results - page 81 / 105
» Bidimensionality and geometric graphs
Sort
View
GLOBECOM
2007
IEEE
14 years 3 months ago
On the Expected Connection Lifetime and Stochastic Resilience of Wireless Multi-Hop Networks
—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 ...
Fei Xing, Wenye Wang
INFOCOM
2006
IEEE
14 years 2 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— 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...
Qing Fang, Jie Gao, Leonidas J. Guibas
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 2 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
MSWIM
2004
ACM
14 years 2 months ago
Quantile models for the threshold range for k-connectivity
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...
Henri Koskinen
AGTIVE
2003
Springer
14 years 2 months ago
Local Specification of Surface Subdivision Algorithms
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
Colin Smith, Przemyslaw Prusinkiewicz, Faramarz F....