Sciweavers

71 search results - page 5 / 15
» Testing Problems with Sub-Learning Sample Complexity
Sort
View
ICMLA
2009
13 years 5 months ago
Regularizing the Local Similarity Discriminant Analysis Classifier
Abstract--We investigate parameter-based and distributionbased approaches to regularizing the generative, similarity-based classifier called local similarity discriminant analysis ...
Luca Cazzanti, Maya R. Gupta
ICCV
2005
IEEE
14 years 1 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
13 years 11 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
LCTRTS
2010
Springer
14 years 2 months ago
Sampling-based program execution monitoring
For its high overall cost during product development, program debugging is an important aspect of system development. Debugging is a hard and complex activity, especially in time-...
Sebastian Fischmeister, Yanmeng Ba
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 1 months ago
Load Shedding for Window Joins on Multiple Data Streams
We consider the problem of semantic load shedding for continuous queries containing window joins on multiple data streams and propose a robust approach that is effective with the ...
Yan-Nei Law, Carlo Zaniolo