Sciweavers

2487 search results - page 296 / 498
» Partitions of Graphs into Trees
Sort
View
116
Voted
COCOON
2007
Springer
15 years 9 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
99
Voted
ICPR
2006
IEEE
16 years 4 months ago
Combinatorial Surface Integration
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
Edwin R. Hancock, Roberto Fraile
AI
2009
Springer
15 years 10 months ago
Automatic Frame Extraction from Sentences
We present a method for automatic extraction of frames from .a dependency graph. Our method uses machine learning applied to a dependency tree to assign frames and assign frame ele...
Martin Scaiano, Diana Inkpen
121
Voted
ICANN
2007
Springer
15 years 9 months ago
Theoretical Analysis of Accuracy of Gaussian Belief Propagation
Abstract. Belief propagation (BP) is the calculation method which enables us to obtain the marginal probabilities with a tractable computational cost. BP is known to provide true m...
Yu Nishiyama, Sumio Watanabe
120
Voted
ISSS
1995
IEEE
100views Hardware» more  ISSS 1995»
15 years 7 months ago
Optimal code generation for embedded memory non-homogeneous register architectures
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
Guido Araujo, Sharad Malik