Sciweavers

5244 search results - page 525 / 1049
» Structural Complexity of AvgBPP
Sort
View
LATIN
2010
Springer
16 years 1 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...
ICSM
2007
IEEE
16 years 1 months ago
Package Surface Blueprints: Visually Supporting the Understanding of Package Relationships
Large object-oriented applications are structured over large number of packages. Packages are important but complex structural entities that may be difficult to understand since ...
Stéphane Ducasse, Damien Pollet, Mathieu Su...
EUROPAR
2007
Springer
16 years 1 months ago
Fine Tuning Algorithmic Skeletons
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...
Denis Caromel, Mario Leyton
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi
GIR
2006
ACM
16 years 1 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai