3820 search results - page 203 / 764 » Bounded Model Debugging |
155
click to vote
AMC
2011
14 years 10 months ago
2011
In this paper, we propose approximate inverse-free preconditioners for solving Toeplitz systems. The preconditioners are constructed based on the famous Gohberg-Sememcul formula. ...
95
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...
138
click to vote
ECCC
2011
14 years 10 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
129
click to vote
STACS
1994
Springer
15 years 7 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
145
click to vote
SIGSOFT
2003
ACM
16 years 4 months ago
2003
ACM
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...