4009 search results - page 145 / 802 » Clustering on Complex Graphs |
126
click to vote
JMLR
2010
14 years 10 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
113
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
153
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
142
click to vote
PVLDB
2010
14 years 10 months ago
2010
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
110
click to vote
COLT
2006
Springer
15 years 7 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...