Sciweavers

2266 search results - page 269 / 454
» Generalizing parametric timing analysis
Sort
View
SIGMETRICS
2003
ACM
115views Hardware» more  SIGMETRICS 2003»
15 years 6 months ago
Dynamic resource allocation for shared data centers using online measurements
Since web workloads are known to vary dynamically with time, in this paper, we argue that dynamic resource allocation techniques are necessary to provide guarantees to web applicat...
Abhishek Chandra, Weibo Gong, Prashant J. Shenoy
CIKM
2003
Springer
15 years 6 months ago
Hierarchical graph indexing
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
James Abello, Yannis Kotidis
101
Voted
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 4 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
109
Voted
FSTTCS
1995
Springer
15 years 4 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
112
Voted
AUTONOMICS
2008
ACM
15 years 2 months ago
On modeling of self-organizing systems
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...
Richard Holzer, Hermann de Meer