559 search results - page 101 / 112 » Algorithms and Data Structures for External Memory |
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
CPM
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
88
Voted
ISSTA
2000
ACM
15 years 1 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
JAIR
2008
14 years 9 months ago
2008
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...