Sciweavers

11182 search results - page 2117 / 2237
» Shape Analysis of Sets
Sort
View
PODC
2006
ACM
14 years 4 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
SENSYS
2006
ACM
14 years 4 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
SIGCOMM
2006
ACM
14 years 4 months ago
Planet scale software updates
Fast and effective distribution of software updates (a.k.a. patches) to millions of Internet users has evolved into a critical task over the last years. In this paper, we characte...
Christos Gkantsidis, Thomas Karagiannis, Milan Voj...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
SIGSOFT
2006
ACM
14 years 4 months ago
Memories of bug fixes
The change history of a software project contains a rich collection of code changes that record previous development experience. Changes that fix bugs are especially interesting, ...
Sunghun Kim, Kai Pan, E. James Whitehead Jr.
« Prev « First page 2117 / 2237 Last » Next »