Sciweavers

1454 search results - page 41 / 291
» Learning with cost intervals
Sort
View
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
15 years 3 months ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
15 years 1 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ECTEL
2006
Springer
15 years 1 months ago
Who Needs "Blended Learning"? Some Thoughts on a Political Concept
The paper covers the topic from an e-learning provider's perspective on the basis of practical experience and discussions with corporate and SME partners. In this paper the au...
Ray Mary Rosdale
IROS
2008
IEEE
142views Robotics» more  IROS 2008»
15 years 4 months ago
Apprenticeship learning for motion planning with application to parking lot navigation
— Motion and path-planning algorithms often use complex cost functions for both global navigation and local smoothing of trajectories. Obtaining good results typically requires c...
Pieter Abbeel, Dmitri Dolgov, Andrew Y. Ng, Sebast...
AI
1998
Springer
14 years 9 months ago
Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
Tom Bylander