نتایج جستجو برای: oracle

تعداد نتایج: 12654  

2015
Jesús Rebollo

We assume that the convex set K is presented by an oracle. We shall consider two kinds of oracles: • Separation Oracle: we ask if a point x is in K. If x ∈ K, the oracle answers ”yes”. If x / ∈ K the oracle returns a half-space H such that K ⊂ H and x / ∈ K. In addition, we are given two numbers r,R ∈ R such that there exists a point x0 (unknown) satisfying x0 + rBn ⊂ K ⊂ RBn. • Membership Orac...

Journal: :IACR Cryptology ePrint Archive 2010
Dan Boneh Özgür Dagdelen Marc Fischlin Anja Lehmann Christian Schaffner Mark Zhandry

The interest in post-quantum cryptography — classical systems that remain secure in the presence of a quantum adversary — has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have classical access to the random oracle. We argue that to prove post-quantum security one needs to prove secu...

2013
Mark Harman Phil McMinn Muzammil Shahbaz Shin Yoo

Testing involves examining the behaviour of a system in order to discover potential faults. Determining the desired correct behaviour for a given input is called the “oracle problem”. Oracle automation is important to remove a current bottleneck which inhibits greater overall test automation; without oracle automation, the human has to determine whether observed behaviour is correct. The litera...

2015
Carlos Gómez-Rodríguez Daniel Fernández-González

We define a dynamic oracle for the Covington non-projective dependency parser. This is not only the first dynamic oracle that supports arbitrary non-projectivity, but also considerably more efficient (O(n)) than the only existing oracle with restricted non-projectivity support. Experiments show that training with the dynamic oracle significantly improves parsing accuracy over the static oracle ...

2009
Hao Song

In the previous lectures, we have introduced the concept of deterministic oracle Turing machines. The concept of non-deterministic oracle Turing machines is just a direct extension of that to the non-deterministic case. To be precise, a non-deterministic oracle Turing machine (sometimes abbreviated to “oracle NTM”) is just like a deterministic oracle TM, but with a non-deterministic transition ...

Journal: :International Journal for Research in Applied Science and Engineering Technology 2017

Journal: :Journal of Computer and System Sciences 1994

Journal: :Electronic Journal of Statistics 2007

Journal: :IEEE Transactions on Information Theory 2018

Journal: :IEEE Transactions on Software Engineering 2021

We propose a human-in-the-loop approach for oracle improvement and analyse whether the proposed process is helping developers to create better oracles. For this, we conducted two human studies with 68 participants overall: an assessment study study. Our results show that exhibit poor performance (29 percent accuracy) when manually assessing assertion contains false positive, negative or none of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید