Sciweavers

16091 search results - page 3215 / 3219
» Solving
Sort
View
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
16 years 2 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
EUROSYS
2007
ACM
15 years 11 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...
STACS
2010
Springer
15 years 8 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
QSHINE
2009
IEEE
15 years 8 months ago
Integration of OMF-Based Testbeds in a Global-Scale Networking Facility
PlanetLab is a global scale platform for experimentation of new networking applications in a real environment. It consists of several nodes, offered by academic institutions or co...
Giovanni Di Stasi, Stefano Avallone, Roberto Canon...
FOCS
2008
IEEE
15 years 8 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
« Prev « First page 3215 / 3219 Last » Next »