967 search results - page 123 / 194 » Building a Calculus of Data Structures |
POPL
2011
ACM
12 years 10 months ago
2011
ACM
Containers are general-purpose data structures that provide functionality for inserting, reading, removing, and iterating over elements. Since many applications written in modern ...
VIS
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a method to represent unstructured scalar fields at multiple levels of detail. Using a parallelizable classification algorithm to build a cluster hierarchy, we generate...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— The recent progress in robot mapping (or SLAM) algorithms has focused on estimating either point features (such as landmarks) or grid-based representations. Both of these repre...
CARDIS
2004
Springer
14 years 1 months ago
2004
Springer
DeKaRT primitives are key-dependent reversible circuits presented at CHES 2003. According to the author, the circuits described are suitable for data scrambling but also as buildin...