2698 search results - page 246 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
145
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...
165
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
213
click to vote
VISAPP
2007
15 years 7 months ago
2007
In this paper, we address the problem of robustly recovering several instances of a curve model from a single noisy data set with outliers. Using M-estimators revisited in a Lagran...
162
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
166
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...