Sciweavers

4865 search results - page 123 / 973
» The Complexity of Graph Connectivity
Sort
View
80
Voted
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 4 months ago
A Generalized Signal Transition Graph Model for Specification of Complex Interfaces
This paper introduces a new Generalized Signal Transition Graph model for specifying complex mixed asynchronous/synchronouscircuits, as found in system-level interfaces. Our goal h...
Peter Vanbekbergen, Chantal Ykman-Couvreur, Bill L...
90
Voted
CORR
2004
Springer
115views Education» more  CORR 2004»
15 years 14 days ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
75
Voted
ATAL
2005
Springer
15 years 6 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
JMLR
2006
118views more  JMLR 2006»
15 years 18 days 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
124
Voted
CIE
2006
Springer
15 years 4 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky