Results 291 to 300 of about 921,934 (330)

Output-Sensitive Evaluation of Regular Path Queries

Proc. ACM Manag. Data
We study the classical evaluation problem for regular path queries: Given an edge-labeled graph and a regular path query, compute the set of pairs of vertices that are connected by paths that match the query.
Mahmoud Abo Khamis, Ahmet Kara, Dan Olteanu, Dan Suciu   +3 more
semanticscholar   +1 more source

A general algorithm for output-sensitive visibility preprocessing

Proceedings of the 2005 symposium on Interactive 3D graphics and games, 2005
Occlusion culling based on precomputed visibility information is a standard method for accelerating the rendering in real-time graphics applications. In this paper we present a new general algorithm that performs the visibility precomputation for a group of viewcells in an output-sensitive fashion.
openaire   +1 more source

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm

Journal of Algorithms, 1997
Summary: We present a truly practical and provably optimal \(O(n\log h)\) time output-sensitive algorithm for the planar convex hull problem. The basic algorithm is similar to the algorithm presented by \textit{T. M. Chan}, \textit{J. Snoeyink}, and \textit{C. K. Yap} [Clarkson, K.
Bhattacharya, Binay K., Sen, Sandeep
openaire   +2 more sources

An efficient output-sensitive hidden surface removal algorithm and its parallelization

Proceedings of the fourth annual symposium on Computational geometry - SCG '88, 1988
In this paper we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly like the terrain maps. A distinguishing feature of this algorithm is that its running time is sensitive to the actual size of the visible image rather than the total number of ...
J. H. Reif, S. Sen
openaire   +1 more source

Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems

Embedded Systems and Applications, 2015
Fritz Bökler, Petra Mutzel
semanticscholar   +1 more source

Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals

2017
We consider the space-efficient implementation of greedy algorithms for several fundamental problems on intervals. We assume a random access machine model with read-only access to input stored in \(\varTheta (n)\) words of memory, augmented with a random access memory (workspace) of size \(\varTheta (s)\) bits, where \(\lg n \le s \le n\).
Toshiki Saitoh, David G. Kirkpatrick
openaire   +1 more source

Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences

IEEE/ACM Transactions on Computational Biology & Bioinformatics, 2012
Biing-feng Wang
semanticscholar   +1 more source

Noisy intermediate-scale quantum algorithms

Reviews of Modern Physics, 2022
Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw   +2 more
exaly  

Variational quantum algorithms

Nature Reviews Physics, 2021
Marco Cerezo, Andrew Arrasmith, Ryan Babbush   +2 more
exaly  

Multi-qubit entanglement and algorithms on a neutral-atom quantum computer

Nature, 2022
Yunheung Song, Cody Poole, Brandon Grinkemeyer   +2 more
exaly