2745 search results - page 117 / 549 » A fast algorithm for computing large Fibonacci numbers |
126
click to vote
TPDS
1998
15 years 3 months ago
1998
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
140
Voted
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
151
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
151
Voted
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
143
Voted
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...