Sciweavers

2168 search results - page 356 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
WWW
2008
ACM
16 years 3 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
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 3 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 ...
ATAL
2010
Springer
15 years 4 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
BMCBI
2006
76views more  BMCBI 2006»
15 years 3 months ago
Coloring the Mu transpososome
Background: Tangle analysis has been applied successfully to study proteins which bind two segments of DNA and can knot and link circular DNA. We show how tangle analysis can be e...
Isabel K. Darcy, Jeff Chang, Nathan Druivenga, Col...
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 3 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee