10608 search results - page 550 / 2122 » Complexity of O'Hara's Algorithm |
181
click to vote
IPL
2010
15 years 5 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
140
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
178
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
205
click to vote
ACAL
2009
Springer
16 years 1 months ago
2009
Springer
The Information Fusion Panel within The Technical Cooperation Program (TTCP) is developing algorithms to perform machine-based situation assessment to assist human operators in co...
198
click to vote
DEXAW
2008
IEEE
16 years 1 months ago
2008
IEEE
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...