582 search results - page 43 / 117 » Distance Measures for Well-Distributed Sets |
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
APVIS
2008
13 years 10 months ago
2008
by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative str...
ICDM
2007
IEEE
14 years 3 months ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
PST
2008
13 years 10 months ago
2008
This paper presents a new personal data access control (PDAC) scheme that is inspired by the protection schemes practiced in communities for sharing valuable commodities. The PDAC...
STACS
2001
Springer
14 years 1 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...