Sciweavers

239 search results - page 11 / 48
» Some Results on Greedy Embeddings in Metric Spaces
Sort
View
ICALP
1992
Springer
15 years 1 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
15 years 6 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
ICML
2003
IEEE
15 years 10 months ago
Cross-Entropy Directed Embedding of Network Data
We present a novel approach to embedding data represented by a network into a lowdimensional Euclidean space. Unlike existing methods, the proposed method attempts to minimize an ...
Takeshi Yamada, Kazumi Saito, Naonori Ueda
SDM
2009
SIAM
154views Data Mining» more  SDM 2009»
15 years 6 months ago
AMORI: A Metric-Based One Rule Inducer.
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
Niklas Lavesson, Paul Davidsson
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 9 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert