Results 51 to 60 of about 2,755,381 (193)
Performance analysis of cone detection algorithms [PDF]
Journal of the Optical Society of America A, 2015 Many algorithms have been proposed to help clinicians evaluate cone density and spacing, as these may be related to the onset of retinal diseases. However, there has been no rigorous comparison of the performance of these algorithms. In addition, the performance of such algorithms is typically determined by comparison with human observers.
Mariotti, Letizia, Devaney, Nicholas
openaire +3 more sources
Sampling-based Algorithms for Optimal Motion Planning [PDF]
, 2011 During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness.
Abramowitz M +51 more
core +3 more sources
Performance Analysis of Effective Symbolic Methods for Solving Band Matrix SLAEs [PDF]
, 2019 This paper presents an experimental performance study of implementations of three symbolic algorithms for solving band matrix systems of linear algebraic equations with heptadiagonal, pentadiagonal, and tridiagonal coefficient matrices.
Ayriyan, Alexander, Veneva, Milena
core +2 more sources
The location of the first maximum in the first sojourn of a Dyck path [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analysis of ...
Helmut Prodinger
doaj +1 more source
An Analysis of Visual Question Answering Algorithms
, 2017 In visual question answering (VQA), an algorithm must answer text-based questions about images. While multiple datasets for VQA have been created since late 2014, they all have flaws in both their content and the way algorithms are evaluated on them.
Kafle, Kushal, Kanan, Christopher
core +1 more source
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In a barter exchange market, agents bring items and seek to exchange their items with one another. Agents may agree to a k-way exchange involving a cycle of k agents.
Timothy Highley, Hoang Le
doaj +1 more source
Discrete Fourier analysis of multigrid algorithms [PDF]
, 2011 The main topic of this report is a detailed discussion of the discrete Fourier multilevel analysis of multigrid algorithms. First, a brief overview of multigrid methods is given for discretizations of both linear and nonlinear partial differential ...
Rhebergen, S., Vegt, J.J.W. van der
core +2 more sources
Experimental Analysis of Algorithms for Coflow Scheduling
, 2016 Modern data centers face new scheduling challenges in optimizing job-level performance objectives, where a significant challenge is the scheduling of highly parallel data flows with a common performance goal (e.g., the shuffle operations in MapReduce ...
CA Phillips +7 more
core +1 more source
Convergence of adaptive stochastic Galerkin FEM [PDF]
, 2018 We propose and analyze novel adaptive algorithms for the numerical solution of elliptic partial differential equations with parametric uncertainty.
Bespalov, Alex +3 more
core +2 more sources
Tight Euler tours in uniform hypergraphs - computational aspects [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Zbigniew Lonc +2 more
doaj +1 more source