Sciweavers

752 search results - page 6 / 151
» Faster approximation algorithms for the minimum latency prob...
Sort
View
CVPR
2010
IEEE
13 years 3 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
CIE
2010
Springer
13 years 10 months ago
A Faster Algorithm for Finding Minimum Tucker Submatrices
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are centr...
Guillaume Blin, Romeo Rizzi, Stéphane Viale...
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
13 years 11 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
IPL
2011
112views more  IPL 2011»
13 years 1 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
14 years 7 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito