Sciweavers

316 search results - page 24 / 64
» On the Space Complexity of Randomized Synchronization
Sort
View
NIPS
2004
14 years 11 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
ICRA
2008
IEEE
165views Robotics» more  ICRA 2008»
15 years 4 months ago
An almost communication-less approach to task allocation for multiple Unmanned Aerial Vehicles
— In this paper, we present a scalable, decentralized task allocation algorithm for a group of unknown number of Unmanned Aerial Vehicles (UAVs), which are equipped with GPS rece...
Peng Cheng, Vijay Kumar
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
15 years 3 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
PODS
2006
ACM
95views Database» more  PODS 2006»
15 years 10 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...