Sciweavers

315 search results - page 52 / 63
» Cell-probe lower bounds for the partial match problem
Sort
View
PVLDB
2008
123views more  PVLDB 2008»
13 years 7 months ago
Propagating functional dependencies with conditions
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 7 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 7 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
PODS
2009
ACM
110views Database» more  PODS 2009»
14 years 8 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 2 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...