9209 search results - page 41 / 1842 » Data Space Randomization |
121
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
135
Voted
PDPTA
2004
15 years 3 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
124
Voted
ADAEUROPE
2003
Springer
15 years 7 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
126
Voted
COCO
2009
Springer
15 years 8 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
121
click to vote
COMPGEOM
1994
ACM
15 years 6 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...