Results 121 to 130 of about 16,929 (167)
Some of the next articles are maybe not open access.
2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016
Suppose, we are given V = {1, 2, …, n} ≡ [n], a set of n points, that can be clustered into k parts V i , i = 1, …, k; V i ∩ V j = ∅, ∀i ≠ j; the subsets V i ⊂ [n] and k are unknown to us. There is an oracle that can answer any pair-wise queries V × V → {±1}, where a query answer of +1 for (u, v) ∈ V ×V indicates u and v belong to the same cluster ...
Arya Mazumdar, Barna Saha
openaire +2 more sources
Suppose, we are given V = {1, 2, …, n} ≡ [n], a set of n points, that can be clustered into k parts V i , i = 1, …, k; V i ∩ V j = ∅, ∀i ≠ j; the subsets V i ⊂ [n] and k are unknown to us. There is an oracle that can answer any pair-wise queries V × V → {±1}, where a query answer of +1 for (u, v) ∈ V ×V indicates u and v belong to the same cluster ...
Arya Mazumdar, Barna Saha
openaire +2 more sources
Sci. Ann. Cuza Univ., 1993
Summary: We define a class of grammars with regulated rewriting based on the idea of oracles: certain nonterminals act as ``bifurcation symbols'', having associated language oracles; if the left/right neighbouring (maximal) terminal string for a given symbol belongs to the corresponding oracle, then a precisely identified nonterminal is produced ...
Lila Kari +3 more
openaire +2 more sources
Summary: We define a class of grammars with regulated rewriting based on the idea of oracles: certain nonterminals act as ``bifurcation symbols'', having associated language oracles; if the left/right neighbouring (maximal) terminal string for a given symbol belongs to the corresponding oracle, then a precisely identified nonterminal is produced ...
Lila Kari +3 more
openaire +2 more sources
computational complexity, 2008
Problems solvable in deterministic polynomial time given oracle access to the promise version of Arthur-Merlin class are studied. The authors prove that \(\mathrm{BPP}_{||}^{\mathrm{NP}} \subseteq \mathrm{P}_{||}^{\mathrm{prAM}}\) and \(\mathrm{S}_2^p \subseteq \mathrm{P}^{\mathrm{prAM}}\). In addition, new upper bounds for the classes \(\mathrm{S}_2^p\
Venkatesan T. Chakaravarthy +1 more
openaire +5 more sources
Problems solvable in deterministic polynomial time given oracle access to the promise version of Arthur-Merlin class are studied. The authors prove that \(\mathrm{BPP}_{||}^{\mathrm{NP}} \subseteq \mathrm{P}_{||}^{\mathrm{prAM}}\) and \(\mathrm{S}_2^p \subseteq \mathrm{P}^{\mathrm{prAM}}\). In addition, new upper bounds for the classes \(\mathrm{S}_2^p\
Venkatesan T. Chakaravarthy +1 more
openaire +5 more sources
10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings., 2003
We present the light field oracle, a novel mathematical concept for the acquisition, processing and representation of light fields. We first compute a hierarchical representation from a set of sparse image samples using a combination of wavelet transform and scattered data interpolation. The light field oracle then progressively acquires image data and
Reto Lütolf +2 more
openaire +3 more sources
We present the light field oracle, a novel mathematical concept for the acquisition, processing and representation of light fields. We first compute a hierarchical representation from a set of sparse image samples using a combination of wavelet transform and scattered data interpolation. The light field oracle then progressively acquires image data and
Reto Lütolf +2 more
openaire +3 more sources
2006
Combining two well-known techniques – pushdown automata and oracles – results in a new class of parsers (oracle pushdown automata) having many advantages It makes possible to combine easily different parsing techniques handling different language aspects into a single parser Such composition moreover preserves simplicity of design of the combined parts
openaire +1 more source
Combining two well-known techniques – pushdown automata and oracles – results in a new class of parsers (oracle pushdown automata) having many advantages It makes possible to combine easily different parsing techniques handling different language aspects into a single parser Such composition moreover preserves simplicity of design of the combined parts
openaire +1 more source
ACM SIGGRAPH ASIA 2008 computer animation festival, 2008
Flavien Lens +3 more
openaire +2 more sources
Flavien Lens +3 more
openaire +2 more sources
Towards better long-tailed oracle character recognition with adversarial data augmentation
Pattern Recognition, 2023Qiufeng Wang, Kaizhu Huang
exaly
Module structure detection of oracle characters with similar semantics
AEJ - Alexandria Engineering Journal, 2021Qingju Jiao, Yongge Liu
exaly
Review: Oracle Essentials: Oracle 9i, Oracle 8i and Oracle 8
The Computer Bulletin, 2001openaire +1 more source
Connect API with Blockchain: A Survey on Blockchain Oracle Implementation
ACM Computing Surveys, 2023Amirmohammad Pasdar +2 more
exaly