Search Sciweavers | Sciweavers

3250 search results - page 31 / 650

» Parameterized Learning Complexity

click to vote

FSTTCS
2010
Springer

132views Software Engineering» more FSTTCS 2010»

Determining the Winner of a Dodgson Election is Hard

13 years 7 months ago

Download www.ii.uib.no

Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...

Michael R. Fellows, Bart M. P. Jansen, Daniel Loks...

claim paper

Read More »

click to vote

ESA
2009
Springer

129views Algorithms» more ESA 2009»

Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem

14 years 4 months ago

Download www.cs.technion.ac.il

Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...

Dániel Marx, Igor Razgon

claim paper

Read More »

click to vote

COLT
2007
Springer

107views Machine Learning» more COLT 2007»

Teaching Dimension and the Complexity of Active Learning

14 years 4 months ago