2925 search results - page 43 / 585 » Information Complexity of Online Problems |
142
click to vote
SIGDOC
2006
ACM
15 years 12 months ago
2006
ACM
While earlier work provided a partial view of users’ preferences about manuals, for most users in most work contexts the important question remains open: What do users want in d...
148
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
150
click to vote
UAI
2003
15 years 7 months ago
2003
Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of onl...
166
click to vote
INFOVIS
1995
IEEE
15 years 9 months ago
1995
IEEE
Visualizations which depict entire information spaces provide context for navigation and browsing tasks; however, the limited size of the display screen makes creating effective g...
165
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...