Sciweavers

1041 search results - page 78 / 209
» Randomizing Reductions of Search Problems
Sort
View
CN
2000
109views more  CN 2000»
13 years 7 months ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
ICB
2009
Springer
412views Biometrics» more  ICB 2009»
14 years 2 months ago
Bayesian Face Recognition Based on Markov Random Field Modeling
In this paper, a Bayesian method for face recognition is proposed based on Markov Random Fields (MRF) modeling. Constraints on image features as well as contextual relationships be...
Rui Wang, Zhen Lei, Meng Ao, Stan Z. Li
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
13 years 11 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 1 months ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...
PAMI
2008
270views more  PAMI 2008»
13 years 8 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...