66 search results - page 6 / 14 » Theoretic study of distributed graph planning |
MOBIHOC
2007
ACM
14 years 6 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
FOCS
2003
IEEE
14 years 6 hour ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
CP
2003
Springer
13 years 12 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
HT
2009
ACM
14 years 1 months ago
2009
ACM
Folksonomies provide a rich source of data to study social patterns taking place on the World Wide Web. Here we study the temporal patterns of users’ tagging activity. We show t...