Sciweavers

3265 search results - page 317 / 653
» Representing Groups on Graphs
Sort
View
179
Voted
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
15 years 10 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
SGP
2003
15 years 8 months ago
Stellar Subdivision Grammars
In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which ...
Luiz Velho
NIPS
1998
15 years 8 months ago
Inference in Multilayer Networks via Large Deviation Bounds
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
Michael J. Kearns, Lawrence K. Saul
DAM
2006
81views more  DAM 2006»
15 years 6 months ago
Equivalence-free exhaustive generation of matroid representations
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
Petr Hlinený
ENTCS
2006
116views more  ENTCS 2006»
15 years 6 months ago
Semantics of Visual Models in a Rule-based Setting
In this paper, some fundamental aspects of the semantics of rule-based systems are sketched and related to the semantics of visual models. A rule-based system comprises a set of r...
Hans-Jörg Kreowski, Karsten Hölscher, Pe...