Sciweavers

384 search results - page 46 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
PAMI
2011
13 years 2 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
GG
2008
Springer
13 years 8 months ago
Graph Transformation for Topology Modelling
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
Mathieu Poudret, Agnès Arnould, Jean-Paul C...
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
BMCBI
2011
12 years 11 months ago
Learning sparse models for a dynamic Bayesian network classifier of protein secondary structure
Background: Protein secondary structure prediction provides insight into protein function and is a valuable preliminary step for predicting the 3D structure of a protein. Dynamic ...
Zafer Aydin, Ajit Singh, Jeff Bilmes, William Staf...