Algorithms for Numerical Analysis in High Dimensions
نویسندگان
چکیده
منابع مشابه
Algorithms for Numerical Analysis in High Dimensions
Nearly every numerical analysis algorithm has computational complexity that scales exponentially in the underlying physical dimension. The separated representation, introduced previously, allows many operations to be performed with scaling that is formally linear in the dimension. In this paper we further develop this representation by (i) discussing the variety of mechanisms that allow it to b...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملStreaming algorithms for proximity problems in high dimensions
In this project, we study proximity problems in high dimensional space. We give efficient algorithms in the data stream model that compute an approximation of the Minimum Enclosing Ball and diameter of a point set. We also give a simple insertion only data sructure that answers approximate farthest point queries.
متن کاملParallel Algorithms for Nearest Neighbor Search Problems in High Dimensions
The nearest neighbor search problem in general dimensions finds application in computational geometry, computational statistics, pattern recognition, and machine learning. Although there is a significant body of work on theory and algorithms, surprisingly little work has been done on algorithms for high-end computing platforms and no open source library exists that can scale efficiently to thou...
متن کاملAlgorithms for Detecting Distance-Based Outliers in High Dimensions
In this paper, we study efficient algorithms for detecting distance-based outliers from a set of n d-dimensional points with respect to two threshold integer parameters k and M , and a radius parameter r. First, we design an algorithm utilizing d-dimensional balls to facilitate fast local search, achieving an O((3.1 √ 2eπ)kn) time complexity for detecting DB(k, r) outliers. This algorithm impro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2005
ISSN: 1064-8275,1095-7197
DOI: 10.1137/040604959