325 search results - page 51 / 65 » Alternatives to two classic data structures |
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
CHI
1999
ACM
15 years 1 months ago
1999
ACM
not abstract asymmetry: different sides looks different clumps different from ”data objects” need grid structure, alignment [Design Guidelines for Landmarks to Support Navigati...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Structured light systems use projected light to augment a scene with extra information. The goal of such systems is often the recovery of depth information based on 2D image(s) fr...
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
SMALLTALK
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Development environments typically present the software engineer with a structural perspective of an object-oriented system in terms of packages, classes and methods. Fro...