15033 search results - page 148 / 3007 » Complexity Theory and Algorithms |
167
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
195
click to vote
CSR
2011
Springer
14 years 7 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
154
click to vote
ANTS
2010
Springer
15 years 7 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
130
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
126
Voted
ICDAR
2009
IEEE
15 years 10 months ago
2009
IEEE
We have proposed a complete system for text detection and localization in gray scale scene images. A boosting framework integrating feature and weak classifier selection based on...