74 search results - page 14 / 15 » The communication complexity of the Hamming distance problem |
MM
2004
ACM
13 years 11 months ago
2004
ACM
This paper deals with phrase structure detection in contemporary western dance. Phrases are a sequence of movements that exist at semantic abstraction than gestures. The problem i...
MOBICOM
2010
ACM
13 years 6 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
INFOCOM
2007
IEEE
14 years 13 days 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)...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
PODC
2006
ACM
14 years 2 days ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...