1136 search results - page 4 / 228 » Finding Small Holes |
CRYPTO
2007
Springer
14 years 4 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, we present an approach to design passive coupling matrix to overcome the performance limitation of direction finding using small aperture array. This approach is i...
EUROCRYPT
2005
Springer
14 years 3 months ago
2005
Springer
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
MICCAI
2010
Springer
13 years 8 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
AI
2011
Springer
13 years 1 months ago
2011
Springer
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...