Sciweavers

561 search results - page 25 / 113
» An empirical analysis of the FixCache algorithm
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
CVPR
2006
IEEE
14 years 1 months ago
A Modular Approach to the Analysis and Evaluation of Particle Filters for Figure Tracking
This paper presents the first systematic empirical study of the particle filter (PF) algorithms for human figure tracking in video. Our analysis and evaluation follows a modula...
Ping Wang, James M. Rehg
ICML
2009
IEEE
14 years 8 months ago
Good learners for evil teachers
We consider a supervised machine learning scenario where labels are provided by a heterogeneous set of teachers, some of which are mediocre, incompetent, or perhaps even malicious...
Ofer Dekel, Ohad Shamir
CVIU
2008
75views more  CVIU 2008»
13 years 7 months ago
Performance characterization in computer vision: A guide to best practices
It is frequently remarked that designers of computer vision algorithms and systems cannot reliably predict how algorithms will respond to new problems. A variety of reasons have b...
Neil A. Thacker, Adrian F. Clark, John L. Barron, ...
ML
2002
ACM
168views Machine Learning» more  ML 2002»
13 years 7 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy