2924 search results - page 115 / 585 » Lower Bounds in Distributed Computing |
88
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
123
click to vote
TSP
2010
14 years 7 months ago
2010
We consider distributed estimation of a deterministic vector parameter from noisy sensor observations in a wireless sensor network (WSN). The observation noise is assumed uncorrela...
92
Voted
BMCBI
2007
15 years 23 days ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
104
Voted
IPSN
2005
Springer
15 years 6 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
111
Voted
UAI
2004
15 years 2 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...