Popular distances in 3-space
نویسندگان
چکیده
Let m(n) denote the smallest integer m with the property that any set of n points in Euclidean 3-space has an element such that at most m other elements are equidistant from it. We have that cn log log n6m(n)6n (n); where c¿0 is a constant and (n) is an extremely slowly growing function, related to the inverse of the Ackermann function. c © 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
Divergence in popular diets relative to diets consumed by Americans, and implications for diet selection.
CONTEXT Given the seemingly disparate nature of popular weight-loss diets (WLDs), consumers may have a difficult time choosing one. We hypothesized that because most of these diets differ greatly from the way most Americans spontaneously eat, the choice of a WLD may be less critical than the decision to adopt any WLD. OBJECTIVE To assess the degree of similarity among several popular WLDs and...
متن کاملApproximating Higher-Order Distances Using Random Projections
We provide a simple method and relevant theoretical analysis for efficiently estimating higherorder lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6, 8, 10..., (i.e., when p is even). Distance-based methods are popular in machine learning. In large-scale applications, storing, computing, and retrieving the distances can be both space and time pro...
متن کاملFast and Scalable Outlier Detection with Approximate Nearest Neighbor Ensembles
Popular outlier detection methods require the pairwise comparison of objects to compute the nearest neighbors. This inherently quadratic problem is not scalable to large data sets, making multidimensional outlier detection for big data still an open challenge. Existing approximate neighbor search methods are designed to preserve distances as well as possible. In this article, we present a highl...
متن کاملSimilarity-Based Text Clustering: A Comparative Study
Clustering of text documents enables unsupervised categorization and facilitates browsing and search. Any clustering method has to embed the objects to be clustered in a suitable representational space that provides a measure of (dis)similarity between any pair of objects. While several clustering methods and the associated similarity measures have been proposed in the past for text clustering,...
متن کاملConvex Optimizations for Distance Metric Learning and Pattern Classification
The goal of machine learning is to build automated systems that can classify and recognize complex patterns in data. Not surprisingly, the representation of the data plays an important role in determining what types of patterns can be automatically discovered. Many algorithms for machine learning assume that the data are represented as elements in a metric space. For example, in popular algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 200 شماره
صفحات -
تاریخ انتشار 1999