Sciweavers

4131 search results - page 256 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
SIAMMAX
2010
103views more  SIAMMAX 2010»
14 years 11 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý
ICCV
2011
IEEE
14 years 4 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller
AAAI
2012
13 years 6 months ago
Learning Games from Videos Guided by Descriptive Complexity
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speci...
Lukasz Kaiser
INFORMS
1998
100views more  INFORMS 1998»
15 years 3 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
144
Voted
PAA
2007
15 years 3 months ago
Pairwise feature evaluation for constructing reduced representations
Feature selection methods are often used to determine a small set of informative features that guarantee good classification results. Such procedures usually consist of two compon...
Artsiom Harol, Carmen Lai, Elzbieta Pekalska, Robe...