5138 search results - page 498 / 1028 » Randomized Algorithms for 3-SAT |
163
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
161
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper presents a chip-level charged device model (CDM) electrostatic discharge (ESD) simulation method. The chip-level simulation is formulated as a DC analysis problem. A ne...
182
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
161
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
152
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a recursive spatial-domain speckle reduction algorithm for synthetic aperture radar (SAR) imagery based on the unscented Kalman filter (UKF) with a discontinuity-adapt...