Results 321 to 330 of about 325,385 (370)
Some of the next articles are maybe not open access.
Foundational Oracle Patterns: Connecting Blockchain to the Off-chain World
International Conference on Business Process Management, 2020Blockchain has evolved into a platform for decentralized applications, with beneficial properties like high integrity, transparency, and resilience against censorship and tampering.
Roman Mühlberger+6 more
semanticscholar +1 more source
Computations with oracles [PDF]
We investigate a class of generalized calculations on Turing machines with oracles which were considered in papers by \textit{N. V. Belyakin} [Mat. Sb., Nov. Ser. 101(143), 21-43 (1976; Zbl 0342.02031)] and \textit{V. A. Ganov} [''The selector function and the continuum hypothesis'' (Russian) (manuscript deposited at VINITI (Moscow) No.94-81)].
openaire +2 more sources
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
IACR Cryptology ePrint Archive, 2019The famous Fiat-Shamir transformation turns any public-coin three-round interactive proof, i.e., any so-called \(\Sigma {\text {-protocol}}\), into a non-interactive proof in the random-oracle model.
Jelle Don+3 more
semanticscholar +1 more source
On Public Crowdsource-Based Mechanisms for a Decentralized Blockchain Oracle
IEEE transactions on engineering management, 2020Blockchain technology has created an excitement that was last seen two decades ago when the Internet was entering the mainstream. An appealing feature of blockchain technology is smart contracts. A smart contract is an executable code.
Keerthi Nelaturu+6 more
semanticscholar +1 more source
2014
This chapter provides an overview of the Oracle DBMS. Actually, you have been exposed to Oracle throughout Division C of the text, since the implementation of SQL that we have studied is Oracle-based. The chapter proceeds under the following subheadings.
Elvis C. Foster, Shripad V. Godbole
openaire +2 more sources
This chapter provides an overview of the Oracle DBMS. Actually, you have been exposed to Oracle throughout Division C of the text, since the implementation of SQL that we have studied is Oracle-based. The chapter proceeds under the following subheadings.
Elvis C. Foster, Shripad V. Godbole
openaire +2 more sources
OBC306: A Large-Scale Oracle Bone Character Recognition Dataset
IEEE International Conference on Document Analysis and Recognition, 2019The oracle bone script from ancient China is among the world's most famous ancient writing systems. Identifying and deciphering oracle bone scripts is one of the most important topics in oracle bone study and requires a deep familiarity with the culture ...
Shuangping Huang+4 more
semanticscholar +1 more source
Decision Oracles are Equivalent to Matching Oracles
1999One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separation or reduction arguments are the basic means for this classification.
Yiannis Tsiounis+2 more
openaire +2 more sources
2006
The factor oracle is a relatively new data structure for the set of factors of a string which has been introduced by Allauzen, Crochemore, and Raffinot in 1999. It may recognize non-factors (hence the name “oracle”) but its implementational simplicity and experimental behaviour are stunning; factor oracle based string matching has been conjectured ...
Crochemore, Maxime+2 more
openaire +3 more sources
The factor oracle is a relatively new data structure for the set of factors of a string which has been introduced by Allauzen, Crochemore, and Raffinot in 1999. It may recognize non-factors (hence the name “oracle”) but its implementational simplicity and experimental behaviour are stunning; factor oracle based string matching has been conjectured ...
Crochemore, Maxime+2 more
openaire +3 more sources
Algebra and Logic, 1990
Metarecursion and computation with Turing machines with oracles pertains to the theory of abstract decidability, which retains analogs of computation. Thus, in metarecursion and the theory of \(\mathcal F\)- computations (i.e., computations using the oracle \(\mathcal F\)), the foreground is occupied by such algorithmic notions as the constructive ...
openaire +1 more source
Metarecursion and computation with Turing machines with oracles pertains to the theory of abstract decidability, which retains analogs of computation. Thus, in metarecursion and the theory of \(\mathcal F\)- computations (i.e., computations using the oracle \(\mathcal F\)), the foreground is occupied by such algorithmic notions as the constructive ...
openaire +1 more source