817 search results - page 14 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
PC
2011
13 years 3 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
PAMI
2012
11 years 11 months ago
2012
—We describe an approach for segmenting a moving image into regions that correspond to surfaces in the scene that are partially surrounded by the medium. It integrates both appea...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
PAMI
2010
13 years 7 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...