Sciweavers

233 search results - page 28 / 47
» On Some Optimization Heuristics for Lesk-Like WSD Algorithms
Sort
View
ROBIO
2006
IEEE
125views Robotics» more  ROBIO 2006»
14 years 2 months ago
Multi-target Detection by Multi-sensor Systems: A Comparison of Systems
– Different methodologies exist to direct the motion of sensors to detect targets moving across an environment in various scenarios. However, some of these do not model that navi...
P. K. Ganesh, K. Madhava Krishna, Paulo Menezes
ICONIP
2007
13 years 10 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
14 years 10 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
14 years 3 months ago
Cheating for problem solving: a genetic algorithm with social interactions
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
Rafael Lahoz-Beltra, Gabriela Ochoa, Uwe Aickelin
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller