Sciweavers

221 search results - page 15 / 45
» On Approximating the Radii of Point Sets in High Dimensions
Sort
View
DCG
2008
93views more  DCG 2008»
13 years 7 months ago
Robust Shape Fitting via Peeling and Grating Coresets
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
SIAMSC
2008
198views more  SIAMSC 2008»
13 years 7 months ago
Model Reduction for Large-Scale Systems with High-Dimensional Parametric Input Space
A model-constrained adaptive sampling methodology is proposed for reduction of large-scale systems with high-dimensional parametric input spaces. Our model reduction method uses a ...
T. Bui-Thanh, Karen Willcox, Omar Ghattas
JMLR
2006
206views more  JMLR 2006»
13 years 7 months ago
New Algorithms for Efficient High-Dimensional Nonparametric Classification
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
Ting Liu, Andrew W. Moore, Alexander G. Gray
COLT
2010
Springer
13 years 5 months ago
Principal Component Analysis with Contaminated Data: The High Dimensional Case
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
Huan Xu, Constantine Caramanis, Shie Mannor
SIAMSC
2008
168views more  SIAMSC 2008»
13 years 7 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi