4541 search results - page 640 / 909 » Cache-Oblivious Algorithms and Data Structures |
239
click to vote
CPM
2006
Springer
15 years 11 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
192
click to vote
EDBT
2000
ACM
15 years 10 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
187
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...
218
click to vote
SODA
1990
ACM
15 years 8 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...
165
click to vote
IJRR
2008
15 years 7 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...