3874 search results - page 310 / 775 » Approximation Algorithms for k-hurdle Problems |
167
click to vote
DAM
2011
14 years 12 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
139
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
136
click to vote
ICNP
2006
IEEE
15 years 11 months ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
128
Voted
CSE
2008
IEEE
15 years 5 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
151
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...