Sciweavers

1550 search results - page 65 / 310
» Optimizing search by showing results in context
Sort
View
TIP
2002
116views more  TIP 2002»
13 years 8 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
AAAI
1998
13 years 10 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
CIVR
2004
Springer
122views Image Analysis» more  CIVR 2004»
14 years 2 months ago
User Strategies in Video Retrieval: A Case Study
In this paper we present the results of a user study that was conducted in combination with a submission to TRECVID 2003. Search behavior of students querying an interactive video-...
Laura Hollink, Giang P. Nguyen, Dennis Koelma, A. ...
GECCO
2010
Springer
174views Optimization» more  GECCO 2010»
14 years 17 days ago
Real-coded genetic algorithm benchmarked on noiseless black-box optimization testbed
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
Thanh-Do Tran, Gang-Gyoo Jin
GECCO
2010
Springer
188views Optimization» more  GECCO 2010»
14 years 17 days ago
Benchmarking real-coded genetic algorithm on noisy black-box optimization testbed
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
Thanh-Do Tran, Gang-Gyoo Jin