Sciweavers

2925 search results - page 4 / 585
» Information Complexity of Online Problems
Sort
View
TCS
2008
13 years 10 months ago
On the power of lookahead in on-line server routing problems
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...
ICML
2009
IEEE
14 years 11 months ago
Interactively optimizing information retrieval systems as a dueling bandits problem
We present an on-line learning framework tailored towards real-time learning from observed user behavior in search engines and other information retrieval systems. In particular, ...
Yisong Yue, Thorsten Joachims
ACL
2009
13 years 8 months ago
Recognizing Stances in Online Debates
This paper presents an unsupervised opinion analysis method for debate-side classification, i.e., recognizing which stance a person is taking in an online debate. In order to hand...
Swapna Somasundaran, Janyce Wiebe
JUCS
2008
196views more  JUCS 2008»
13 years 11 months ago
Information Integration for the Masses
Abstract: Information integration applications combine data from heterogeneous sources to assist the user in solving repetitive data-intensive tasks. Currently, such applications r...
Jim Blythe, Dipsy Kapoor, Craig A. Knoblock, Krist...
CHI
2006
ACM
14 years 11 months ago
Talk to me: foundations for successful individual-group interactions in online communities
People come to online communities seeking information, encouragement, and conversation. When a community responds, participants benefit and become more committed. Yet interactions...
Jaime Arguello, Brian S. Butler, Elisabeth Joyce, ...