Sciweavers

591 search results - page 16 / 119
» An Efficient Algorithm for Local Distance Metric Learning
Sort
View
BMVC
1998
14 years 11 months ago
ORASSYLL: Object Recognition with Autonomously Learned and Sparse Symbolic Representations Based on Local Line Detectors
We introduce an object recognition system in which objects are represented as a sparse and spatially organized set of local (bent) line segments. The line segments correspond to b...
Norbert Krüger, Niklas Lüdtke
ICML
2009
IEEE
15 years 10 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri
ICML
2003
IEEE
15 years 10 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford
CVPR
2010
IEEE
15 years 28 days ago
Metric-Induced Optimal Embedding for Intrinsic 3D Shape Analysis
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
Rongjie Lai, Yonggang Shi, Kevin Scheibel, Scott F...
CVPR
2003
IEEE
15 years 11 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...