Sciweavers

4926 search results - page 24 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 7 months ago
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
Éric Colin de Verdière, Alexander Sc...
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
14 years 1 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
ICCV
2003
IEEE
14 years 9 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
ICCSA
2009
Springer
14 years 2 months ago
YAO: A Software for Variational Data Assimilation Using Numerical Models
Variational data assimilation consists in estimating control parameters of a numerical model in order to minimize the misfit between the forecast values and some actual observatio...
Luigi Nardi, Charles Sorror, Fouad Badran, Sylvie ...
DSD
2003
IEEE
138views Hardware» more  DSD 2003»
14 years 27 days ago
A Two-step Genetic Algorithm for Mapping Task Graphs to a Network on Chip Architecture
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
Tang Lei, Shashi Kumar