Sciweavers

59 search results - page 11 / 12
» Optimal Spectral-Galerkin Methods Using Generalized Jacobi P...
Sort
View
128
Voted
PAMI
2008
189views more  PAMI 2008»
15 years 1 months ago
Detecting Objects of Variable Shape Structure With Hidden State Shape Models
This paper proposes a method for detecting object classes that exhibit variable shape structure in heavily cluttered images. The term "variable shape structure" is used t...
Jingbin Wang, Vassilis Athitsos, Stan Sclaroff, Ma...
95
Voted
AAAI
2008
15 years 3 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
122
Voted
ATAL
2010
Springer
15 years 1 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko
149
Voted
CVPR
2009
IEEE
15 years 4 months ago
Nonlinear Nonnegative Component Analysis
In this paper general solutions for Nonlinear Nonnegative Component Analysis for data representation and recognition are proposed. That is, motivated by a combination of the Nonne...
Stefanos Zafeiriou, Maria Petrou
112
Voted
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 10 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...