2430 search results - page 345 / 486 » Computing Tutte Polynomials |
160
click to vote
APPROX
2009
Springer
16 years 29 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
164
click to vote
CSSE
2008
IEEE
16 years 25 days ago
2008
IEEE
—This paper presents an auxiliary model based stochastic gradient parameter estimation algorithm for multiinput output-error systems by minimizing a quadratic cost function. The ...
188
click to vote
APPROX
2007
Springer
16 years 16 days ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
168
click to vote
ASIACRYPT
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
197
click to vote
TACAS
2007
Springer
16 years 14 days ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...