Sciweavers

244 search results - page 18 / 49
» Oscillating Search Algorithms for Feature Selection
Sort
View
MM
2010
ACM
115views Multimedia» more  MM 2010»
13 years 6 months ago
Interactive learning of heterogeneous visual concepts with local features
In the context of computer-assisted plant identification we are facing challenging information retrieval problems because of the very high within-class variability and of the lim...
Wajih Ouertani, Michel Crucianu, Nozha Boujemaa
ICIP
2002
IEEE
14 years 9 months ago
Efficient selection of image patches with high motion confidence
Motion confidence measures aim to identify how well an image patch determines image motion. These kinds of confidence measures are commonly used to select points for optical flow ...
Peter Sand, Leonard McMillan
SIGIR
2002
ACM
13 years 7 months ago
Document clustering with cluster refinement and model selection capabilities
In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clus...
Xin Liu, Yihong Gong, Wei Xu, Shenghuo Zhu
ATAL
2006
Springer
13 years 11 months ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm
AIR
1998
103views more  AIR 1998»
13 years 7 months ago
Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis
Abstract. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc...
Francisco Herrera, Manuel Lozano, José L. V...