Sciweavers

1888 search results - page 334 / 378
» Information Distance
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 11 months ago
Maximum inner-product search using cone trees
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...
Parikshit Ram, Alexander G. Gray
IPSN
2007
Springer
14 years 2 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
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...
Rik Sarkar, Xianjin Zhu, Jie Gao
AINA
2005
IEEE
14 years 2 months ago
Sensor Inter-Vehicle Communication for Safer Highways
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...
Mimoza Durresi, Arjan Durresi, Leonard Barolli
INFOCOM
2007
IEEE
14 years 3 months ago
On Optimal MAC Scheduling With Physical Interference
— 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)...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
DATAMINE
2007
110views more  DATAMINE 2007»
13 years 8 months ago
The complexity of non-hierarchical clustering with instance and cluster level constraints
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...
Ian Davidson, S. S. Ravi