Results 11 to 20 of about 8,552 (239)

On Recursion [PDF]

open access: yesFrontiers in Psychology, 2014
It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused.
Jeffrey eWatumull   +4 more
doaj   +6 more sources

Hardware acceleration of number theoretic transform for zk‐SNARK

open access: yesEngineering Reports, EarlyView., 2023
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao   +6 more
wiley   +1 more source

Recursed is not Recursive: A Jarring Result

open access: yesCoRR, 2020
Recursed is a 2D puzzle platform video game featuring treasure chests that, when jumped into, instantiate a room that can later be exited (similar to function calls), optionally generating a jar that returns back to that room (similar to continuations).
Erik D. Demaine   +2 more
openaire   +5 more sources

To recurse or not to recurse: a low-dose CT study [PDF]

open access: yesProgress in Artificial Intelligence, 2021
Restoring high-quality CT images from low-dose CT counterparts is an ill-posed, nonlinear problem to which deep learning approaches have shown promising results compared to classical model-based approaches. Feedforward neural networks, whose output at any given time depends only on their input at that specific time slot, have been widely used to ...
Shabab Bazrafkan   +4 more
openaire   +2 more sources

Recursive percolation [PDF]

open access: yesPhysical Review E, 2015
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation thresholds up to $n=5$. The corresponding critical clusters become more and more compact as $n$ increases, and define
Deng, Youjin   +2 more
openaire   +3 more sources

Recursive categoricity and recursive stability

open access: yesAnnals of Pure and Applied Logic, 1986
This paper comprises two parts. 1. A model \({\mathcal A}\) in a class \({\mathcal C}\) is strongly recursively stable in C if 1) A is recursively presented and 2) if B is elementarily equivalent to A and B is in C, then not only is B isomorphic to A but every isomorphism from B onto A is recursive.
John N. Crossley   +2 more
openaire   +2 more sources

Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with Scalability

open access: yesAdvances in Neural Information Processing Systems 36, 2023
Binary Balanced Tree RvNNs (BBT-RvNNs) enforce sequence composition according to a preset balanced binary tree structure. Thus, their non-linear recursion depth is just $\log_2 n$ ($n$ being the sequence length). Such logarithmic scaling makes BBT-RvNNs efficient and scalable on long sequence tasks such as Long Range Arena (LRA).
Jishnu Ray Chowdhury, Cornelia Caragea
openaire   +3 more sources

Givenness and Stress Rejection

open access: yesLanguages, 2022
This paper addresses the impact of givenness on phrasal stress assignment in German. It has been observed for English that nuclear stress is rejected on given elements that are part of the focused material if another focused word is available to bear ...
Fabian Schubö
doaj   +1 more source

Integrable discretization of recursion operators and unified bilinear forms to soliton hierarchies [PDF]

open access: yesOpen Communications in Nonlinear Mathematical Physics
In this paper, we give a procedure for discretizing recursion operators by utilizing unified bilinear forms within integrable hierarchies. To illustrate this approach, we present unified bilinear forms for both the AKNS hierarchy and the KdV hierarchy ...
Xingbiao Hu, Guofu Yu, Yingnan Zhang
doaj   +1 more source

Computability and Recursion [PDF]

open access: yesBulletin of Symbolic Logic, 1996
AbstractWe consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to define it, “(Turing)computability” and “(general)recursiveness”. We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they ...
openaire   +1 more source

Home - About - Disclaimer - Privacy