3874 search results - page 261 / 775 » Approximation Algorithms for k-hurdle Problems |
172
click to vote
EOR
2007
15 years 4 months ago
2007
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
205
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Restoring a clear image from a single motion-blurred
image due to camera shake has long been a challenging
problem in digital imaging. Existing blind deblurring techniques
eithe...
107
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
162
click to vote
NIPS
2007
15 years 5 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
169
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...