Sciweavers

11211 search results - page 27 / 2243
» (Data) STRUCTURES
Sort
View
76
Voted
SIGSOFT
1994
ACM
15 years 1 months ago
Reengineering a Complex Application Using a Scalable Data Structure Compiler
1 P2 is a scalable compiler for collection data structures. High-level ions insulate P2 users from data structure implementation details. By specifying a target data structure as a...
Don S. Batory, Jeff Thomas, Marty Sirkin
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
15 years 3 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
ICML
2007
IEEE
15 years 10 months ago
Learning for efficient retrieval of structured data with noisy queries
Increasingly large collections of structured data necessitate the development of efficient, noise-tolerant retrieval tools. In this work, we consider this issue and describe an ap...
Charles Parker, Alan Fern, Prasad Tadepalli
ICNP
2007
IEEE
15 years 3 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
STACS
2010
Springer
15 years 4 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf