2925 search results - page 25 / 585 » Information Complexity of Online Problems |
102
Voted
GLOBECOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—In this paper, we consider the Bayesian CramerRao bound (BCRB) for the dynamical estimation of multi-path Rayleigh channel complex gains in data-aided (DA) and non-dataa...
112
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
113
click to vote
WWW
2009
ACM
16 years 2 months ago
2009
ACM
In the last decade, there has been an explosion of online commercial activity enabled by the World Wide Web. An electronic marketplace (e-market) provides an online method to perf...
136
Voted
CORR
2012
Springer
13 years 9 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
125
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...