315 search results - page 29 / 63 » An Optimal Algorithm for the Maximum-Density Segment Problem |
104
click to vote
AAAI
2010
15 years 3 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
137
Voted
ACCV
2007
Springer
15 years 5 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
128
Voted
ADHOCNOW
2010
Springer
14 years 12 months ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
122
click to vote
EMMCVPR
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
160
Voted
IPMI
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. We introduce a novel algorithm for actin filament segmentation in 2D TIRFM image sequences. This problem is difficult because actin filaments dynamically change shapes ...