Sciweavers

16 search results - page 2 / 4
» A guessing game and randomized online algorithms
Sort
View
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 7 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
CHI
2009
ACM
14 years 2 months ago
Matchin: eliciting user preferences with an online game
Eliciting user preferences for large datasets and creating rankings based on these preferences has many practical applications in community-based sites. This paper gives a new met...
Severin Hacker, Luis von Ahn
NOSSDAV
2009
Springer
14 years 1 months ago
Probabilistic event resolution with the pairwise random protocol
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
John L. Miller, Jon Crowcroft
KCAP
2005
ACM
14 years 27 days ago
Collecting paraphrase corpora from volunteer contributors
Extensive and deep paraphrase corpora are important for a variety of natural language processing and user interaction tasks. In this paper, we present an approach which i) collect...
Timothy Chklovski
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 8 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis