Sciweavers

JMLR
2006
118views more  JMLR 2006»
13 years 3 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
JCP
2006
91views more  JCP 2006»
13 years 3 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
ECCC
2006
145views more  ECCC 2006»
13 years 3 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
DAM
2006
100views more  DAM 2006»
13 years 3 months ago
On the colored Tutte polynomial of a graph of bounded treewidth
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
Lorenzo Traldi
CPC
2006
93views more  CPC 2006»
13 years 3 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 3 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini
CORR
2006
Springer
78views Education» more  CORR 2006»
13 years 3 months ago
Efficient algorithms for deciding the type of growth of products of integer matrices
For a given finite set of matrices with nonnegative integer entries we study the growth with t of max{ A1
Raphael M. Jungers, Vladimir Protasov, Vincent D. ...
ENTCS
2008
102views more  ENTCS 2008»
13 years 3 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ENTCS
2008
75views more  ENTCS 2008»
13 years 3 months ago
Intensional Properties of Polygraphs
Abstract
Guillaume Bonfante, Yves Guiraud
DISOPT
2008
78views more  DISOPT 2008»
13 years 3 months ago
N-fold integer programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...