1888 search results - page 334 / 378 » Information Distance |
160
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
169
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
165
click to vote
AINA
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we present a sensor inter-vehicle communication protocol based on geographical routing. Sensors installed in cars continuously gather important information about: ai...
142
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
116
click to vote
DATAMINE
2007
15 years 4 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...