Sciweavers

280 search results - page 22 / 56
» Storage Alternatives for Large Structured State Spaces
Sort
View
WSCG
2004
197views more  WSCG 2004»
13 years 10 months ago
Collision Prediction Using MKtrees
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
Marta Franquesa-Niubó, Pere Brunet
ICFEM
2010
Springer
13 years 7 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
14 years 6 days ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
OSDI
2002
ACM
14 years 9 months ago
Secure Routing for Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks provide a substrate for the construction of large-scale, decentralized applications, including distributed storage, group communication, a...
Miguel Castro, Peter Druschel, Ayalvadi J. Ganesh,...
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 8 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro