7006 search results - page 449 / 1402 » Approximation Algorithms |
109
Voted
RANDOM
1998
Springer
15 years 9 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
169
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
136
Voted
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
In this work we revisit the Mumford-Shah functional, one
of the most studied variational approaches to image segmentation.
The contribution of this paper is to propose an
algori...
143
Voted
SIGGRAPH
1998
ACM
15 years 9 months ago
1998
ACM
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...
142
click to vote
SOFSEM
2007
Springer
15 years 11 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...