Sciweavers

2434 search results - page 158 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ASIACRYPT
2009
Springer
15 years 10 months ago
Improved Generic Algorithms for 3-Collisions
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...
Antoine Joux, Stefan Lucks
GECCO
2006
Springer
122views Optimization» more  GECCO 2006»
15 years 7 months ago
Genetic algorithms are suitable for driving microbial ecosystems in desirable directions
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
Frederik P. J. Vandecasteele, Thomas F. Hess, Rona...
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 10 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe

Lecture Notes
443views
17 years 1 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
ICPR
2000
IEEE
16 years 4 months ago
A Parallel Algorithm for Tracking of Segments in Noisy Edge Images
We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution ?a set of segments that reason...
Pedro E. López-de-Teruel, Alberto Ruiz, Jos...