697 search results - page 63 / 140 » Improving EAs for Sequencing Problems |
144
Voted
JACM
2010
15 years 1 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
135
click to vote
SC
2005
ACM
15 years 9 months ago
2005
ACM
A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem ...
112
Voted
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Structure-from-motion (SfM) is an important computer vision problem and largely relies on the quality of feature tracking. In image sequences, if disjointed tracks caused...
123
Voted
NIPS
2008
15 years 4 months ago
2008
Accurate and efficient inference in evolutionary trees is a central problem in computational biology. While classical treatments have made unrealistic site independence assumption...
144
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...