521 search results - page 35 / 105 » Coring method for clustering a graph |
127
click to vote
CVPR
2000
IEEE
15 years 8 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
167
click to vote
NIPS
2004
15 years 5 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...
140
click to vote
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collecte...
131
Voted
APVIS
2007
15 years 5 months ago
2007
In this paper, we introduce a new method, GraphScape, to visualize multivariate networks, i.e., graphs with multivariate data associated with their nodes. GraphScape adopts a land...
152
Voted
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...