1162 search results - page 28 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
127
Voted
FSMNLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
120
Voted
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
130
Voted
GD
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
135
click to vote
JGO
2010
15 years 2 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
141
click to vote
NOSSDAV
2005
Springer
15 years 9 months ago
2005
Springer
Multimedia applications today constitute a significant fraction of the workload running on portable devices such as mobile phones, PDAs and MP3 players. However, the processors i...