Sciweavers

484 search results - page 39 / 97
» Measuring the Quality of Approximated Clusterings
Sort
View
ISPASS
2003
IEEE
15 years 11 months ago
On evaluating request-distribution schemes for saving energy in server clusters
Power-performance optimization is a relatively new problem area particularly in the context of server clusters. Poweraware request distribution is a method of scheduling service r...
Karthick Rajamani, Charles Lefurgy
DAWAK
2003
Springer
15 years 11 months ago
Handling Large Workloads by Profiling and Clustering
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...
Matteo Golfarelli
TMA
2012
Springer
232views Management» more  TMA 2012»
14 years 1 months ago
Distributed Troubleshooting of Web Sessions Using Clustering
Web browsing is a very common way of using the Internet to, among others, read news, do on-line shopping, or search for user generated content such as YouTube or Dailymotion. Tradi...
Heng Cui, Ernst Biersack
DCG
2000
104views more  DCG 2000»
15 years 6 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
WWW
2005
ACM
16 years 6 months ago
On the feasibility of low-rank approximation for personalized PageRank
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
András A. Benczúr, Károly Csa...