Sciweavers

247 search results - page 12 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 1 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
FOCS
1999
IEEE
13 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
MVA
1990
123views Computer Vision» more  MVA 1990»
13 years 8 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu
CVPR
2011
IEEE
13 years 3 months ago
Using Global Bag of Features Models in Random Fields for Joint Categorization and Segmentation of Objects
We propose to bridge the gap between Random Field (RF) formulations for joint categorization and segmentation (JCaS), which model local interactions among pixels and superpixels, ...
Dheeraj Singaraju, René, Vidal
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 8 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty