290 search results - page 22 / 58 » Local Partitioning for Directed Graphs Using PageRank |
CSDA
2007
14 years 11 months ago
2007
In this paper, we propose a novel non-parametric clustering method based on non-parametric local shrinking. Each data point is transformed in such a way that it moves a specific ...
107
click to vote
KDD
2008
ACM
16 years 2 days ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
110
click to vote
ALMOB
2006
14 years 11 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
125
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
118
click to vote
ACCV
2009
Springer
15 years 6 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...