Sciweavers

6598 search results - page 401 / 1320
» Graph Theory with Applications
Sort
View
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
16 years 1 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
ISVC
2005
Springer
16 years 8 days ago
Image Smoothing and Segmentation by Graph Regularization
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digi...
Sébastien Bougleux, Abderrahim Elmoataz
IBPRIA
2003
Springer
15 years 12 months ago
Segmentation of Curvilinear Objects Using a~Watershed-Based Curve Adjacency Graph
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
Thierry Géraud
DAC
1998
ACM
15 years 11 months ago
Rate Optimal VLSI Design from Data Flow Graph
This paper considers the rate optimal VLSI design of a recursive data flow graph (DFG). Previous research on rate optimal scheduling is not directly applicable to VLSI design. We ...
Moonwook Oh, Soonhoi Ha
168
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong