Sciweavers

1322 search results - page 53 / 265
» Parameterized counting problems
Sort
View
COLT
1993
Springer
14 years 27 days ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
SMI
2007
IEEE
106views Image Analysis» more  SMI 2007»
14 years 3 months ago
Iterative Methods for Improving Mesh Parameterizations
We present two complementary methods for automatically improving mesh parameterizations and demonstrate that they provide a very desirable combination of efficiency and quality. ...
Shen Dong, Michael Garland
IJCNN
2006
IEEE
14 years 2 months ago
Reinforcement Learning for Parameterized Motor Primitives
Abstract— One of the major challenges in both action generation for robotics and in the understanding of human motor control is to learn the “building blocks of movement genera...
Jan Peters, Stefan Schaal
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
14 years 1 months ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
SIAMJO
2000
61views more  SIAMJO 2000»
13 years 8 months ago
Stability of Locally Optimal Solutions
: Necessary and sufficient conditions are obtained for the Lipschitzian stability of local solutions to finite-dimensional parameterized optimization problems in a very general set...
A. B. Levy, R. A. Poliquin, R. Tyrell Rockafellar