Sciweavers

1092 search results - page 176 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
TOG
2008
193views more  TOG 2008»
15 years 1 months ago
Random-access rendering of general vector graphics
We introduce a novel representation for random-access rendering of antialiased vector graphics on the GPU, along with efficient encoding and rendering algorithms. The representati...
Diego Nehab, Hugues Hoppe
WWW
2008
ACM
16 years 2 months ago
Externalities in online advertising
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
Arpita Ghosh, Mohammad Mahdian
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
16 years 2 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 2 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
15 years 8 months ago
On Revenue Maximization in Second-Price Ad Auctions
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...