126 search results - page 18 / 26 » BAG: a graph theoretic sequence clustering algorithm |
ER
2004
Springer
14 years 1 months ago
2004
Springer
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
WG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
KAIS
2011
13 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...