484 search results - page 88 / 97 » Measuring the Quality of Approximated Clusterings |
151
Voted
NIPS
2004
15 years 3 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...
113
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
158
click to vote
IJCAI
2003
2003
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
15 years 3 months ago
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and...
126
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
111
click to vote
EMMCVPR
1999
Springer
15 years 6 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...