Sciweavers

3250 search results - page 60 / 650
» Parameterized Learning Complexity
Sort
View
EUROCOLT
1997
Springer
14 years 1 months ago
Ordinal Mind Change Complexity of Language Identification
The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learnin...
Andris Ambainis, Sanjay Jain, Arun Sharma
ICAART
2010
INSTICC
14 years 7 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
ECOOP
2006
Springer
14 years 1 months ago
A Semantic Analysis of C++ Templates
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
Jeremy G. Siek, Walid Taha
TOG
2008
139views more  TOG 2008»
13 years 9 months ago
Logarithmic perspective shadow maps
We present a novel shadow map parameterization to reduce perspective aliasing artifacts for both point and directional light sources. We derive the aliasing error equations for bo...
Brandon Lloyd, Naga K. Govindaraju, Cory Quammen, ...
ICPR
2010
IEEE
14 years 5 months ago
Semi-Supervised Distance Metric Learning by Quadratic Programming
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
Hakan Cevikalp