Sciweavers

5785 search results - page 140 / 1157
» Approximability of Probability Distributions
Sort
View
149
Voted
KDD
2000
ACM
101views Data Mining» more  KDD 2000»
15 years 7 months ago
Incremental quantile estimation for massive tracking
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
Fei Chen, Diane Lambert, José C. Pinheiro
126
Voted
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 1 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan
169
Voted
PODC
2009
ACM
16 years 4 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
138
Voted
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 3 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
162
Voted
TWC
2008
135views more  TWC 2008»
15 years 3 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...