721 search results - page 59 / 145 » Almost universal graphs |
114
click to vote
TSP
2010
14 years 6 months ago
2010
We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin ...
119
click to vote
STOC
2009
ACM
16 years 15 days ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
100
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
CORR
2010
Springer
15 years 1 hour ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
113
click to vote
SIGSOFT
2009
ACM
16 years 19 days ago
2009
ACM
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...