19320 search results - page 58 / 3864 » On the complexity of computing determinants |
CSDA
2010
14 years 9 months ago
2010
In this paper, we consider a default strategy for fully Bayesian model determination for GLMMs. We address the two key issues of default prior specification and computation. In pa...
PODC
1997
ACM
15 years 1 months ago
1997
ACM
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents an original computational approach to extraction of movie tempo for deriving story sections and events that convey high level semantics of stories portrayed in...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In the present article, we introduce a new method for identification of metabolic pathways in constraint based models that consider enzyme and substrate concentrations. It genera...