4536 search results - page 662 / 908 » Contention-Sensitive Data Structures and Algorithms |
163
click to vote
AIPS
2000
15 years 8 months ago
2000
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, weare concerned with plans that have i quantitative temporal constrain...
162
click to vote
CCCG
1993
15 years 8 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
201
click to vote
SODA
1990
ACM
15 years 7 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
213
click to vote
CGF
2008
15 years 6 months ago
2008
We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non-rigid registration within a single non-linear optimization....
149
click to vote
IJRR
2008
15 years 6 months ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...