Sciweavers

2084 search results - page 247 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
SPAA
2010
ACM
15 years 2 months ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 5 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
FOCS
2002
IEEE
15 years 3 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
15 years 3 months ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
15 years 1 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala