Sciweavers

1086 search results - page 13 / 218
» Jug measuring: Algorithms and complexity
Sort
View
TMC
2008
127views more  TMC 2008»
13 years 9 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
COLT
2000
Springer
14 years 2 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
JMM2
2007
59views more  JMM2 2007»
13 years 9 months ago
Single-Ended Quality Measurement of Noise Suppressed Speech Based on Kullback-Leibler Distances
— In this paper, a single-ended quality measurement algorithm for noise suppressed speech is described. The proposed algorithm computes fast approximations of KullbackLeibler dis...
Tiago H. Falk, Hua Yuan, Wai-Yip Chan
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
13 years 4 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy