Results 31 to 40 of about 1,031,530 (335)
A simple scheme for expanding photonic cluster states for quantum information [PDF]
, 2010 We show how an entangled cluster state encoded in the polarization of single photons can be straightforwardly expanded by deterministically entangling additional qubits encoded in the path degree of freedom of the constituent photons.
A. Laing +26 more
core +3 more sources
Computing geodesic paths on manifolds [PDF]
Proceedings of the National Academy of Sciences, 1998 The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O ( M log M ) steps, where M is the total number of grid points.
Kimmel, R., Sethian, J. A.
openaire +2 more sources
A path to computational efficiency through membrane computing [PDF]
Theoretical Computer Science, 2019 The search for new mechanisms and tools allowing us to tackle the famousPversusNPproblem from new perspectives is an important task, due to the relevance of that problem.The concept of efficiency of computing models is associated with the ability to solveintractable (in a classical sense) problems in polynomial time.
David Orellana-Martín +3 more
openaire +3 more sources
Journal of Cloud Computing: Advances, Systems and Applications, 2022 In recent years, with the development of Unmanned Aerial Vehicle (UAV) and Cloud Internet-of-Things (Cloud IoT) technology, data collection using UAVs has become a new technology hotspot for many Cloud IoT applications.
Yiguang Gong +3 more
doaj +1 more source
Path Integration on a Quantum Computer
Quantum Information Processing, 2002 24 pages; Revision of 9/2/02 includes a query lower bound and the upper bound of $4.22 \e^{-1}$ to compute an $\e$-approximation to a path ...
Joseph F. Traub, Henryk Wozniakowski
openaire +2 more sources
The minimum energy expenditure shortest path method [PDF]
, 2014 This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path.
Choset H. +14 more
core +1 more source
On the identity type as the type of computational paths [PDF]
Logic Journal of the IGPL, 2017 We introduce a new way of formalizing the intensional identity type based on the fact that a entity known as computational paths can be interpreted as terms of the identity type. Our approach enjoys the fact that our elimination rule is easy to understand and use.
Arthur F. Ramos +2 more
openaire +2 more sources
Shortest Paths Avoiding Forbidden Subpaths [PDF]
, 2009 In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core +6 more sources
Towards knowledge-enriched path computation [PDF]
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014 Accepted as a short paper at ACM SIGSPATIAL GIS ...
Georgios Skoumas +6 more
openaire +2 more sources
Line-distortion, Bandwidth and Path-length of a graph [PDF]
, 2014 We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition.
A. Gupta +15 more
core +1 more source