1241 search results - page 57 / 249 » Path-oriented random testing |
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
107
click to vote
IJCAI
1997
15 years 3 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
136
click to vote
ICMCS
2010
IEEE
15 years 3 months ago
2010
IEEE
In this paper, we propose an unsupervised segmentation algorithm for extracting moving objects/regions from compressed video using Markov Random Field (MRF) classification. First,...
102
click to vote
DAC
2002
ACM
16 years 3 months ago
2002
ACM
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
111
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...