2004 search results - page 56 / 401 » Sampling from large graphs |
KDD
2003
ACM
16 years 6 days ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
ACCV
2007
Springer
15 years 6 months ago
2007
Springer
This paper proposes a novel volume-based motion capture method using a bottom-up analysis of volume data and an example topology database of the human body. By using a two-step gra...
ISCI
2007
14 years 11 months ago
2007
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
CODES
2006
IEEE
15 years 5 months ago
2006
IEEE
Embedded system synthesis, multiprocessor synthesis, and thread assignment policy design all require detailed knowledge of the runtime communication patterns among different threa...
113
click to vote
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...