1736 search results - page 206 / 348 » The rank-width of Directed Graphs |
175
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
150
click to vote
UAI
2001
15 years 7 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
168
click to vote
NIPS
2003
15 years 7 months ago
2003
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
194
click to vote
ICGA
1993
15 years 7 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
196
click to vote
ECRTS
2010
IEEE
15 years 7 months ago
2010
IEEE
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...