Sciweavers

101 search results - page 12 / 21
» Domination Problems in Nowhere-Dense Classes
Sort
View
DAM
1999
119views more  DAM 1999»
13 years 7 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
CRV
2005
IEEE
201views Robotics» more  CRV 2005»
14 years 1 months ago
Minimum Bayes Error Features for Visual Recognition by Sequential Feature Selection and Extraction
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
Gustavo Carneiro, Nuno Vasconcelos
IPCO
2007
143views Optimization» more  IPCO 2007»
13 years 8 months ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea
ICCV
2007
IEEE
14 years 9 months ago
Fast Bilinear SfM with Side Information
We study the beneficial effect of side information on the Structure from Motion (SfM) estimation problem. The side information that we consider is measurement of a `reference vect...
Mahesh Ramachandran, Ashok Veeraraghavan, Rama Che...
CP
2006
Springer
13 years 11 months ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan