321 search results - page 62 / 65 » Partitioning by iterative deletion |
FSTTCS
2009
Springer
14 years 13 days ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
ICCAD
1999
IEEE
14 years 4 days ago
1999
IEEE
This paper addresses the problem of efficient and accurate performance analysis to drive the exploration and design of bus-based System-on-Chip (SOC) communication architectures. ...
NIPS
2004
13 years 9 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
NIPS
1998
13 years 9 months ago
1998
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...