Sciweavers

356 search results - page 10 / 72
» Submodular Approximation: Sampling-based Algorithms and Lowe...
Sort
View
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 7 months ago
Sequential item pricing for unlimited supply
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
Maria-Florina Balcan, Florin Constantin
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
11 years 10 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 8 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 1 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
ICALP
2009
Springer
14 years 8 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang