2498 search results - page 276 / 500 » Data Structures with Unpredictable Timing |
188
click to vote
DSN
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
175
click to vote
CCCG
2006
15 years 8 months ago
2006
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
181
click to vote
TPDS
1998
15 years 6 months ago
1998
—A massive volume of biological sequence data is available in over 36 different databases worldwide, including the sequence data generated by the Human Genome project. These data...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
222
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...