485 search results - page 58 / 97 » Iterative Bounding LAO |
158
click to vote
IWCIA
2004
Springer
15 years 11 months ago
2004
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
129
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
149
click to vote
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...
170
click to vote
CC
2000
Springer
15 years 10 months ago
2000
Springer
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
186
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...