1380 search results - page 169 / 276 » A General Polynomial Sieve |
NMR
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
EUROCRYPT
2003
Springer
14 years 2 months ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
PODS
2010
ACM
14 years 1 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
FOCS
1992
IEEE
14 years 29 days ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...