Sciweavers

9871 search results - page 119 / 1975
» On the Structure of Low Sets
Sort
View
APN
2011
Springer
14 years 10 months ago
On the Origin of Events: Branching Cells as Stubborn Sets
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
Henri Hansen, Xu Wang
CG
2006
Springer
15 years 6 months ago
Interactive out-of-core isosurface visualisation in time-varying data sets
We present a combination of techniques for interactive out-of-core visualisation of isosurfaces from large timedependent data sets. We make use of an index tree, computed in a pre...
Benjamin Vrolijk, Frits H. Post
CIDR
2003
218views Algorithms» more  CIDR 2003»
15 years 7 months ago
Indexing Large Trajectory Data Sets With SETI
With the rapid increase in the use of inexpensive, location-aware sensors in a variety of new applications, large amounts of time-sequenced location data will soon be accumulated....
V. Prasad Chakka, Adam Everspaugh, Jignesh M. Pate...
P2P
2007
IEEE
132views Communications» more  P2P 2007»
16 years 19 days ago
The Design and Evaluation of Techniques for Route Diversity in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough
EUROPAR
2007
Springer
16 years 16 days ago
Compositional Approach Applied to Loop Specialization
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
Lamia Djoudi, Jean-Thomas Acquaviva, Denis Barthou