Sciweavers

46 search results - page 3 / 10
» Approximate congruence in nearly linear time
Sort
View
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 5 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
VLBV
2005
Springer
13 years 11 months ago
Efficient Digital Pre-filtering for Least-Squares Linear Approximation
In this paper we propose a very simple FIR pre-filter based method for near optimal least-squares linear approximation of discrete time signals. A digital pre-processing filter,...
Marco Dalai, Riccardo Leonardi, Pierangelo Miglior...
NIPS
2004
13 years 7 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
ESA
2004
Springer
119views Algorithms» more  ESA 2004»
13 years 11 months ago
A Straight Skeleton Approximating the Medial Axis
We propose the linear axis, a new skeleton for polygonal shapes. It is related to the medial axis and the straight skeleton, being the result of a wavefront propagation process. Th...
Mirela Tanase, Remco C. Veltkamp
COMPGEOM
2003
ACM
13 years 11 months ago
Shape fitting with outliers
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
Sariel Har-Peled, Yusu Wang