Sciweavers

5785 search results - page 508 / 1157
» Approximability of Probability Distributions
Sort
View
TOG
2002
129views more  TOG 2002»
15 years 6 months ago
Homomorphic factorization of BRDF-based lighting computation
Several techniques have been developed to approximate Bidirectional Reflectance Distribution Functions (BRDF) with acceptable quality and performance for realtime applications. Th...
Lutz Latta, Andreas Kolb
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 9 months ago
Optimal crowdsourcing contests
We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
Shuchi Chawla, Jason D. Hartline, Balasubramanian ...
TMC
2012
13 years 9 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi
LICS
2007
IEEE
16 years 1 months ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 10 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld