Sciweavers

1816 search results - page 270 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
CEC
2010
IEEE
14 years 10 months ago
Co-evolutionary search path planning under constrained information-sharing for a cooperative unmanned aerial vehicle team
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
Jean Berger, Jens Happe
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 6 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
CVPR
2006
IEEE
16 years 8 months ago
Extracting Subimages of an Unknown Category from a Set of Images
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...
Sinisa Todorovic, Narendra Ahuja
EVOW
2005
Springer
15 years 12 months ago
An Evolutionary Infection Algorithm for Dense Stereo Correspondence
This work presents an evolutionary approach to improve the infection algorithm to solve the problem of dense stereo matching. Dense stereo matching is used for 3D reconstruction in...
Cynthia B. Pérez, Gustavo Olague, Francisco...
ECAI
2004
Springer
15 years 12 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...