Sciweavers

69 search results - page 7 / 14
» Generic Incremental Algorithms for Local Search
Sort
View
MM
2010
ACM
162views Multimedia» more  MM 2010»
14 years 11 months ago
Interactive visual object search through mutual information maximization
Searching for small objects (e.g., logos) in images is a critical yet challenging problem. It becomes more difficult when target objects differ significantly from the query object...
Jingjing Meng, Junsong Yuan, Yuning Jiang, Nitya N...
ICCV
2009
IEEE
16 years 4 months ago
Deformable Model Fitting with a Mixture of Local Experts
Local experts have been used to great effect for fitting deformable models to images. Typically, the best location in an image for the deformable model’s landmarks are found t...
Jason M. Saragih, Simon Lucey, Jeffrey F. Cohn
IJCAI
2001
15 years 1 months ago
The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
Dale Schuurmans, Finnegan Southey, Robert C. Holte
HEURISTICS
2006
120views more  HEURISTICS 2006»
14 years 11 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
AAAI
1996
15 years 28 days ago
Constructive Neural Network Learning Algorithms
Constructive learning algorithms offer an attractive approach for the incremental construction of near-minimal neural-network architectures for pattern classification. They help ov...
Rajesh Parekh, Jihoon Yang, Vasant Honavar