5606 search results - page 513 / 1122 » Randomization Techniques for Graphs. |
149
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
178
Voted
BMCBI
2007
15 years 7 months ago
2007
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
218
Voted
CICLING
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
166
Voted
ER
2007
Springer
16 years 1 months ago
2007
Springer
Provability-based semantic interoperability (PBSI) is a kind of interoperability that transcends mere syntactic translation to allow for robust, meaningful information exchange acr...
189
Voted
WEA
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...