688 search results - page 55 / 138 » General Partitioning on Random Graphs |
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
102
click to vote
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
92
Voted
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
103
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
112
Voted
STOC
2004
ACM
15 years 5 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...