Sciweavers

Share
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
8 years 5 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
8 years 5 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
8 years 5 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
8 years 5 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
8 years 5 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
OPODIS
2004
8 years 5 months ago
A Hierarchy-Based Fault-Local Stabilizing Algorithm for Tracking in Sensor Networks
In this paper, we introduce the concept of hierarchy-based fault-local stabilization and a novel self-healing/fault-containment technique and apply them in Stalk. Stalk is an algo...
Murat Demirbas, Anish Arora, Tina Nolte, Nancy A. ...
FIMI
2003
88views Data Mining» more  FIMI 2003»
8 years 5 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon
EJC
2003
8 years 5 months ago
A Theory of Signs for Database Semantics
The goal of this paper is to build a bridge from a certain intuitive conception of natural language communication, called the SLIM theory of language, to a technical approach, cal...
Roland Hausser
ESANN
2001
8 years 5 months ago
An integrated neural IR system
Over the years the amount and range of electronic text stored on the WWW has expanded rapidly, overwhelming both users and tools designed to index and search the information. It is...
Victoria J. Hodge, Jim Austin
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
8 years 5 months ago
Interpolation over Light Fields with Applications in Computer Graphics
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
F. Betul Atalay, David M. Mount
books