Sciweavers

1060 search results - page 129 / 212
» Notes on Coding Theory
Sort
View
MOBICOM
2006
ACM
16 years 3 days ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
PODC
2006
ACM
16 years 3 days ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
ISMIR
2005
Springer
152views Music» more  ISMIR 2005»
15 years 11 months ago
ATTA: Automatic Time-Span Tree Analyzer Based on Extended GTTM
This paper describes a music analyzing system called the automatic time-span tree analyzer (ATTA), which we have developed. The ATTA derives a time-span tree that assigns a hierar...
Masatoshi Hamanaka, Keiji Hirata, Satoshi Tojo
ACISP
2004
Springer
15 years 11 months ago
Single Database Private Information Retrieval with Logarithmic Communication
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...
Yan-Cheng Chang
ISMIR
2004
Springer
124views Music» more  ISMIR 2004»
15 years 11 months ago
A Comparison of Rhythmic Similarity Measures
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
Godfried T. Toussaint