777 search results - page 27 / 156 » A fast algorithm for the computation of an upper bound on th... |
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithm...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
COMPGEOM
2010
ACM
14 years 18 days ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
SPDP
1993
IEEE
13 years 11 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...