4541 search results - page 467 / 909 » Cache-Oblivious Algorithms and Data Structures |
160
click to vote
CIKM
1998
Springer
15 years 9 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
140
click to vote
BNCOD
2004
15 years 6 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
141
Voted
SODA
2001
ACM
15 years 6 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
141
click to vote
ENTCS
2002
15 years 4 months ago
2002
Despite considerable effort, the state-space explosion problem remains an issue in the analysis of Markov models. Given structure, symbolic representations can result in very comp...
220
click to vote
IAJIT
2011
15 years 2 days ago
2011
: Number of recent technologies take Geographic Information Systems to new levels of power and usability. One of the most promising technologies that empower Geographic Information...