Sciweavers

1298 search results - page 34 / 260
» The online set cover problem
Sort
View
TIP
2010
188views more  TIP 2010»
14 years 8 months ago
On-line Learning of Mutually Orthogonal Subspaces for Face Recognition by Image Sets
—We address the problem of face recognition by matching image sets. Each set of face images is represented by a subspace (or linear manifold) and recognition is carried out by su...
Tae-Kyun Kim, Josef Kittler, Roberto Cipolla
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 3 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
AAAI
2006
14 years 11 months ago
A Sequential Covering Evolutionary Algorithm for Expressive Music Performance
In this paper, we describe an evolutionary approach to one of the most challenging problems in computer music: modeling the knowledge applied by a musician when performing a score...
Rafael Ramirez, Amaury Hazan, Jordi Marine, Esteba...
COMGEO
2011
ACM
14 years 4 months ago
Covering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin...