601 search results - page 45 / 121 » Measurable sets with excluded distances |
ICDM
2007
IEEE
14 years 4 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...
WADS
2007
Springer
14 years 4 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 11 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...
STACS
2001
Springer
14 years 2 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 ...
LREC
2008
13 years 11 months ago
2008
In this paper we describe an approach that both creates crosslingual acoustic monophone model sets for speech recognition tasks and objectively predicts their performance without ...