11211 search results - page 59 / 2243 » Data Structures |
117
click to vote
ESOP
2009
Springer
15 years 6 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
FDBS
2001
15 years 1 months ago
2001
Commercial, non-profit and public organizations are accumulating huge amounts of electronically available text documents. Although composed of unstructured texts, documents contai...
SPAA
1990
ACM
15 years 3 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
KDD
2003
ACM
16 years 7 days ago
2003
ACM
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
HPCA
2009
IEEE
16 years 11 days ago
2009
IEEE
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...