2925 search results - page 112 / 585 » Information Complexity of Online Problems |
324
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
352
click to vote
DIMVA
2011
14 years 10 months ago
2011
Social networks are some of the largest and fastest growing online services today. Facebook, for example, has been ranked as the second most visited site on the Internet, and has b...
166
click to vote
SIGECOM
2009
ACM
16 years 28 days ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
169
click to vote
EMNLP
2009
15 years 4 months ago
2009
The recently introduced online confidence-weighted (CW) learning algorithm for binary classification performs well on many binary NLP tasks. However, for multi-class problems CW l...
202
click to vote
ICWSM
2009
15 years 4 months ago
2009
Hearing people argue opposing sides of an issue can be a useful way to understand the topic; however, these debates or conversations often don't exist. Unfortunately, generat...