Sciweavers

954 search results - page 150 / 191
» Adaptive Weighing Designs for Keyword Value Computation
Sort
View
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 9 days ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
ACMACE
2009
ACM
15 years 2 months ago
Critical gameplay
How do games effect the way we problem solve, socialize, or even view the world? When we shoot do we learn to destroy obstacles instead of work around them? Does the binary world ...
Lindsay Grace
PETRA
2010
ACM
14 years 11 months ago
Benchmarking dynamic time warping for music retrieval
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
Jefrey Lijffijt, Panagiotis Papapetrou, Jaakko Hol...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
15 years 10 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
SIGECOM
2009
ACM
139views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Simple versus optimal mechanisms
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
Jason D. Hartline, Tim Roughgarden