478 search results - page 24 / 96 » A simple expected running time analysis for randomized |
ICDAR
2009
IEEE
14 years 3 months ago
2009
IEEE
Camera-based character recognition systems should have the capability of quick operation and recognizing perspectively distorted texts in a complex layout. In this paper, in order...
WONS
2005
IEEE
14 years 2 months ago
2005
IEEE
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
RSA
2010
13 years 6 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...