Sciweavers

1041 search results - page 113 / 209
» Randomizing Reductions of Search Problems
Sort
View
CIVR
2007
Springer
139views Image Analysis» more  CIVR 2007»
14 years 2 months ago
Video search in concept subspace: a text-like paradigm
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic ind...
Xirong Li, Dong Wang, Jianmin Li, Bo Zhang
COMPGEOM
2010
ACM
14 years 1 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 2 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
14 years 1 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
14 years 1 months ago
On the Locality of Representations
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
Franz Rothlauf