752 search results - page 98 / 151 » Faster approximation algorithms for the minimum latency prob... |
161
click to vote
NIPS
2007
15 years 8 months ago
2007
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
155
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
166
click to vote
CCCG
1994
15 years 7 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
197
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
177
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...