491 search results - page 71 / 99 » On cyclically orientable graphs |
MICRO
1998
IEEE
14 years 20 days ago
1998
IEEE
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...
UAI
2003
13 years 9 months ago
2003
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
RSA
2008
13 years 8 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
JMLR
2010
13 years 6 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
TCS
2010
13 years 3 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...