Sciweavers

29 search results - page 4 / 6
» Random Geometric Graph Diameter in the Unit Ball
Sort
View
WADS
2007
Springer
82views Algorithms» more  WADS 2007»
15 years 3 months ago
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michie...
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
14 years 11 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
TMC
2011
131views more  TMC 2011»
14 years 4 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
AHSWN
2008
92views more  AHSWN 2008»
14 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
INFOCOM
2008
IEEE
15 years 3 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer