1380 search results - page 175 / 276 » A General Polynomial Sieve |
ALGORITHMICA
1998
13 years 8 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
DATAMINE
1998
13 years 8 months ago
1998
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
JUCS
2010
13 years 7 months ago
2010
: Generalized finite automata with weights for states and transitions have been successfully applied to image generation for more than a decade now. Bilevel images (black and whit...
TCS
2010
13 years 7 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...