Sciweavers

725 search results - page 134 / 145
» Bounding Degrees on RPL
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
ICALP
2001
Springer
14 years 2 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
RTSS
2000
IEEE
14 years 2 months ago
A User-Customizable Energy-Adaptive Combined Static/Dynamic Scheduler for Mobile Applications
In portable applications, the energy consumed by OS and application tasks primarily comes from DC battery source, which is limited and imposes an upper bound to the amount of time...
Trolan C. L. Ma, Kang G. Shin
APPROX
2006
Springer
109views Algorithms» more  APPROX 2006»
14 years 1 months ago
Dobrushin Conditions and Systematic Scan
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 10 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn