Sciweavers

10054 search results - page 1980 / 2011
» On the Complexity of Function Learning
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 7 months ago
Rate-Distortion via Markov Chain Monte Carlo
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
Shirin Jalali, Tsachy Weissman
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 7 months ago
Dynamic Rate Allocation in Fading Multiple-access Channels
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Temporal Support of Regular Expressions in Sequential Pattern Mining
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
The MIMO Iterative Waterfilling Algorithm
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
« Prev « First page 1980 / 2011 Last » Next »