Sciweavers

1450 search results - page 289 / 290
» On the Complexity of Hardness Amplification
Sort
View
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
14 years 6 months ago
Large-scale behavioral targeting
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
Ye Chen, Dmitry Pavlov, John F. Canny
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 6 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
EUROSYS
2007
ACM
14 years 3 months ago
Adaptive control of virtualized resources in utility computing environments
Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utili...
Pradeep Padala, Kang G. Shin, Xiaoyun Zhu, Mustafa...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 14 days ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
13 years 11 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler