316 search results - page 9 / 64 » On the Space Complexity of Randomized Synchronization |
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
DEDS
2002
13 years 7 months ago
2002
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
ICALP
2004
Springer
14 years 24 days ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
WDAG
2005
Springer
14 years 26 days ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...