Sciweavers

SIBGRAPI
2008
IEEE
14 years 5 months ago
Tradeoffs in Approximate Range Searching Made Simpler
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
FOCS
2008
IEEE
14 years 6 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ACSAC
2008
IEEE
14 years 6 months ago
Automatic Inference and Enforcement of Kernel Data Structure Invariants
Kernel-level rootkits affect system security by modifying key kernel data structures to achieve a variety of malicious goals. While early rootkits modified control data structur...
Arati Baliga, Vinod Ganapathy, Liviu Iftode
ITICSE
2009
ACM
14 years 6 months ago
Hybrid and custom data structures: evolution of the data structures course
The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list...
Daniel J. Ernst, Daniel E. Stevenson, Paul J. Wagn...
COMPGEOM
2009
ACM
14 years 6 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
COMPGEOM
2009
ACM
14 years 6 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
TLCA
2009
Springer
14 years 6 months ago
Initial Algebra Semantics for Cyclic Sharing Structures
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
Makoto Hamana
SPIRE
2009
Springer
14 years 6 months ago
Directly Addressable Variable-Length Codes
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
ICCS
2009
Springer
14 years 6 months ago
An Intelligent Tutoring System for Interactive Learning of Data Structures
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...
Rafael del Vado Vírseda, Pablo Ferná...
WADS
2009
Springer
265views Algorithms» more  WADS 2009»
14 years 6 months ago
A Distribution-Sensitive Dictionary with Low Space Overhead
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the ...
Prosenjit Bose, John Howat, Pat Morin