Results 51 to 60 of about 989,695 (238)

Explicit Computational Paths

open access: yes, 2016
The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are proofs that $a$ and $b$ are equal elements of type $A$.
Ramos, Arthur Freitas   +2 more
openaire   +2 more sources

Towards knowledge-enriched path computation [PDF]

open access: yesProceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014
Accepted as a short paper at ACM SIGSPATIAL GIS ...
Mario A. Nascimento   +6 more
openaire   +3 more sources

Why does malaria transmission continue at high levels despite universal vector control? Quantifying persistent malaria transmission by Anopheles funestus in Western Province, Zambia

open access: yesParasites & Vectors
Background Some settings continue to experience a high malaria burden despite scale-up of malaria vector control to high levels of coverage. Characterisation of persistent malaria transmission in the presence of standard control measures, also termed ...
Ruth A. Ashton   +23 more
doaj   +1 more source

Paths, computations and labels in the λ-calculus

open access: yesTheoretical Computer Science, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cosimo Laneve, Andrea Asperti
openaire   +3 more sources

East-West paths to unconventional computing [PDF]

open access: yesProgress in Biophysics and Molecular Biology, 2017
Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited to physics of computation, non-classical logics, new complexity measures, novel hardware, mechanical, chemical and quantum computing.
Adamatzky A   +19 more
openaire   +4 more sources

Overcoming device unreliability with continuous learning in a population coding based computing system

open access: yes, 2018
The brain, which uses redundancy and continuous learning to overcome the unreliability of its components, provides a promising path to building computing systems that are robust to the unreliability of their constituent nanodevices.
Grollier, Julie   +3 more
core   +2 more sources

Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II [PDF]

open access: yes, 2015
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group.
Maslen, David   +2 more
core   +3 more sources

Shortest path computation with no information leakage [PDF]

open access: yesProceedings of the VLDB Endowment, 2012
Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences ...
MOURATIDIS, Kyriakos, YIU, Man Lung
openaire   +4 more sources

Efficient implicit simulation for incremental forming [PDF]

open access: yes, 2010
Single Point Incremental Forming (SPIF) is a displacement controlled process performed on a CNC machine. A clamped blank is deformed by the movement of a small sized tool that follows a prescribed tool path.
Boogaard, A.H. van den, Hadoush, A.
core   +1 more source

CAD Adjacency Computation Using Validated Numerics

open access: yes, 2017
We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g.
Strzebonski, Adam
core   +1 more source

Home - About - Disclaimer - Privacy