316 search results - page 14 / 64 » On the Space Complexity of Randomized Synchronization |
ECOOP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
PODS
2012
ACM
11 years 10 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
ICCS
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...