Sciweavers

3422 search results - page 361 / 685
» Random Subset Optimization
Sort
View
EJC
2007
15 years 4 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
AI
1999
Springer
15 years 4 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle
TIT
2002
129views more  TIT 2002»
15 years 4 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang
JCC
2008
99views more  JCC 2008»
15 years 3 months ago
Assessment of programs for ligand binding affinity prediction
: The prediction of the binding free energy between a ligand and a protein is an important component in the virtual screening and lead optimization of ligands for drug discovery. T...
Ryangguk Kim, Jeffrey Skolnick
CVPR
2012
IEEE
13 years 6 months ago
Top-down and bottom-up cues for scene text recognition
Scene text recognition has gained significant attention from the computer vision community in recent years. Recognizing such text is a challenging problem, even more so than the ...
Anand Mishra, Karteek Alahari, C. V. Jawahar