2899 search results - page 449 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
146
click to vote
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
172
Voted
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
172
Voted
ATVA
2007
Springer
15 years 11 months ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
140
Voted
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
132
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...