Sciweavers

16404 search results - page 721 / 3281
» A set coverage problem
Sort
View
230
Voted
COCOON
2009
Springer
16 years 1 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch
ICCV
2009
IEEE
17 years 8 days ago
A Theory of Active Object Localization
We present some theoretical results related to the problem of actively searching for a target in a 3D environment, under the constraint of a maximum search time. We define the o...
Alexander Andreopoulos, John K. Tsotsos
210
Voted
ICCV
2009
IEEE
17 years 8 days ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
206
Voted
ECCV
2008
Springer
16 years 9 months ago
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
Maria Klodt, Thomas Schoenemann, Kalin Kolev, Mare...
ICML
2006
IEEE
16 years 8 months ago
Higher order learning with graphs
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
Sameer Agarwal, Kristin Branson, Serge Belongie