16404 search results - page 366 / 3281 » A set coverage problem |
123
click to vote
COMBINATORICS
2007
15 years 5 months ago
2007
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...
130
click to vote
FSTTCS
1992
Springer
15 years 9 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
127
click to vote
CJ
2008
15 years 5 months ago
2008
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
133
click to vote
GBRPR
2007
Springer
15 years 9 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
161
click to vote
TIP
2010
14 years 11 months ago
2010
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities du...