Sciweavers

2430 search results - page 192 / 486
» Computing Tutte Polynomials
Sort
View
AAAI
2004
15 years 6 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao
UAI
2000
15 years 6 months ago
Tractable Bayesian Learning of Tree Belief Networks
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...
Marina Meila, Tommi Jaakkola
IPL
2006
86views more  IPL 2006»
15 years 4 months ago
Monotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
Amos Beimel, Enav Weinreb
ICPR
2010
IEEE
15 years 3 months ago
Robust ECG Biometrics by Fusing Temporal and Cepstral Information
—The use of vital signs as a biometric is a potentially viable approach in a variety of application scenarios such as security and personalized health care. In this paper, a nove...
Ming Li, Shrikanth Narayanan
161
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 2 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker