3320 search results - page 438 / 664 » Heuristics for the Phylogeny Problem |
161
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
217
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 10 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
177
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
198
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We propose a convex framework for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast as one...
278
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...