2124 search results - page 19 / 425 » Aggregating time partitions |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
TMC
2011
13 years 2 months ago
2011
—In recent years, there has been an exponential increase in the number of mobile phone users. In addition, a significant growth in the demand for high-rate multimedia services o...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
MICRO
1997
IEEE
13 years 11 months ago
1997
IEEE
The multicluster architecture that we introduce offers a decentralized, dynamically-scheduled architecture, in which the register files, dispatch queue, and functional units of t...
SIGMETRICS
2000
ACM
13 years 12 months ago
2000
ACM
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...