3875 search results - page 292 / 775 » Approximation algorithms for the 0-extension problem |
193
Voted
WAOA
2005
Springer
16 years 7 days ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
208
click to vote
EOR
2007
15 years 6 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,...
265
Voted
CVPR
2009
IEEE
17 years 1 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...
195
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
135
click to vote
ICDE
2010
IEEE
16 years 6 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...