3894 search results - page 317 / 779 » Approximation Algorithms for Biclustering Problems |
203
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we propose a novel algorithm for super resolution based on total variation prior and variational distribution approximations. We formulate the problem using a hierar...
204
click to vote
DAM
2011
15 years 1 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...
172
click to vote
ICML
2010
IEEE
15 years 7 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...
166
click to vote
ICNP
2006
IEEE
16 years 22 days 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...
159
click to vote
CSE
2008
IEEE
15 years 6 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