Sciweavers

138 search results - page 27 / 28
» Graph Laplacians and their convergence on random neighborhoo...
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 9 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 1 days ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 5 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot
PAMI
2010
190views more  PAMI 2010»
13 years 3 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 1 days ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin