1951 search results - page 226 / 391 » An algorithm for improving graph partitions |
119
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
135
Voted
ICMLA
2008
15 years 6 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
152
click to vote
FMSD
2008
15 years 5 months ago
2008
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
177
Voted
TDSC
2010
15 years 3 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
163
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...