150 search results - page 18 / 30 » Polynomial graph invariants from homomorphism numbers |
116
click to vote
ECCC
2011
14 years 4 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
UAI
2000
14 years 11 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
67
Voted
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...