38 search results - page 3 / 8 » A Generalization of Proximity Functions for K-Means |
78
Voted
SAC
2009
ACM
15 years 4 months ago
2009
ACM
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
97
Voted
COMPGEOM
2000
ACM
15 years 1 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
71
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...