Sciweavers

1243 search results - page 207 / 249
» On the locality of bounded growth
Sort
View
CN
2008
97views more  CN 2008»
14 years 12 months ago
Towards real-time dynamic spectrum auctions
In this paper, we propose a low-complexity auction framework to distribute spectrum in real-time among a large number of wireless users with dynamic traffic. Our design consists o...
Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Ha...
CSDA
2010
122views more  CSDA 2010»
14 years 12 months ago
Nonparametric density estimation for positive time series
The Gaussian kernel density estimator is known to have substantial problems for bounded random variables with high density at the boundaries. For i.i.d. data several solutions hav...
Taoufik Bouezmarni, Jeroen V. K. Rombouts
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 12 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang
DC
2008
14 years 12 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 12 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah