2430 search results - page 155 / 486 » Computing Tutte Polynomials |
126
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
130
click to vote
SIAMJO
2000
15 years 4 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
152
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
162
click to vote
IWPEC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
117
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...