Sciweavers

4526 search results - page 71 / 906
» Algorithmic problems related to the Internet
Sort
View
EDBT
2008
ACM
122views Database» more  EDBT 2008»
15 years 10 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
ICAC
2009
IEEE
15 years 4 months ago
Resilient workload manager: taming bursty workload of scaling internet applications
In data centers hosting scaling Internet applications, operators face the tradeoff dilemma between resource efficiency and Quality of Service (QoS), and the root cause lies in wo...
Hui Zhang 0002, Guofei Jiang, Kenji Yoshihira, Hai...
WWW
2008
ACM
15 years 10 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
15 years 4 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 9 months ago
The Snowblower Problem
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...
Esther M. Arkin, Michael A. Bender, Joseph S. B. M...