2137 search results - page 261 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
179
click to vote
RECOMB
2010
Springer
16 years 1 months ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
164
click to vote
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
169
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
190
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
168
click to vote
MP
2006
15 years 6 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...