1728 search results - page 22 / 346 » The Accelerated Euclidean Algorithm |
SIGMETRICS
2006
ACM
15 years 5 months ago
2006
ACM
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
113
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
IDA
2009
Springer
15 years 3 months ago
2009
Springer
Although k-means clustering is often applied to time series clustering, the underlying Euclidean distance measure is very restrictive in comparison to the human perception of time ...
DAC
2002
ACM
16 years 3 days ago
2002
ACM
In this paper, we present a flexible accelerator designed for networking applications. The accelerator can be utilized efficiently by a variety of Network Processor designs. Most ...