Sciweavers

1396 search results - page 125 / 280
» Succinct Dynamic Data Structures
Sort
View
ICSE
2001
IEEE-ACM
15 years 6 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris
90
Voted
VC
2008
99views more  VC 2008»
15 years 1 months ago
Minimizing probable collision pairs searched in interactive animation authoring
Animation authoring involves an author's interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detecti...
Parag Agarwal, Srinivas Rajagopalan, B. Prabhakara...
CORR
2004
Springer
125views Education» more  CORR 2004»
15 years 1 months ago
High-Level Networking With Mobile Code And First Order AND-Continuations
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
Paul Tarau, Verónica Dahl
FOCS
2007
IEEE
15 years 7 months ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin
PPOPP
2003
ACM
15 years 6 months ago
Exploiting high-level coherence information to optimize distributed shared state
InterWeave is a distributed middleware system that supports the sharing of strongly typed, pointer-rich data structures across a wide variety of hardware architectures, operating ...
DeQing Chen, Chunqiang Tang, Brandon Sanders, Sand...