Sciweavers

11214 search results - page 142 / 2243
» Just-in-time data structures
Sort
View
SPAA
1990
ACM
14 years 2 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy
LICS
2002
IEEE
14 years 3 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
VLDB
1998
ACM
153views Database» more  VLDB 1998»
14 years 2 months ago
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
Small Materialized Aggregates (SMAs for short) are considered a highly flexible and versatile alternative for materialized data cubes. The basic idea is to compute many aggregate ...
Guido Moerkotte
GECCO
2009
Springer
204views Optimization» more  GECCO 2009»
14 years 2 months ago
Combined structure and motion extraction from visual data using evolutionary active learning
We present a novel stereo vision modeling framework that generates approximate, yet physically-plausible representations of objects rather than creating accurate models that are c...
Krishnanand N. Kaipa, Josh C. Bongard, Andrew N. M...

Publication
417views
14 years 7 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos