Results 301 to 310 of about 11,417,388 (340)

A fast distributed slicing algorithm

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, 2008
Reference LPD-CONF-2008-036View record in Web of Science URL: http://www.podc.org/podc2008/ Record created on 2008-10-13, modified on 2017-05 ...
Gramoli, Vincent, Vigfusson, Ymir, Birman, Ken, Kermarrec, Anne-Marie, van Renesse, Robbert, Bazzi, Rida, Patt-Shamir, Boaz   +6 more
openaire   +2 more sources

A FAST Pattern Matching Algorithm

Journal of Chemical Information and Computer Sciences, 2004
The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the
Sheik, SS, Aggarwal, Sumit K, Poddar, Anindya, Balakrishnan, N, Sekar, K   +4 more
openaire   +2 more sources

RangeNet ++: Fast and Accurate LiDAR Semantic Segmentation

IEEE/RJS International Conference on Intelligent RObots and Systems, 2019
Perception in autonomous vehicles is often carried out through a suite of different sensing modalities. Given the massive amount of openly available labeled RGB data and the advent of high-quality deep learning algorithms for image-based recognition ...
Andres Milioto, Ignacio Vizzo, Jens Behley, C. Stachniss   +3 more
semanticscholar   +1 more source

Fast Algorithms forK4Immersion Testing

Journal of Algorithms, 1999
Summary: Many useful classes of graphs can in principle be recognized with finite batteries of obstruction tests. One of the most fundamental tests is to determine whether an arbitrary input graph contains \(K_4\) in the immersion order. In this paper, we present for the first time a fast, practical algorithm to accomplish this task. We also extend our
Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi   +3 more
openaire   +1 more source

Two Fast GCD Algorithms

Journal of Algorithms, 1994
The paper presents two new algorithms, the right- and left \(k\)-ary shift algorithms, for the problem of computing the greatest common divisor (GCD) of two given integers. These algorithms are generalizations of the (right-shift) binary and left-shift binary GCD algorithms. For computing the GCD of two \(n\)-bit integers, both algorithms require \(O(n^
openaire   +4 more sources

Are wait-free algorithms fast?

Journal of the ACM, 1994
The time complexity of wait-free algorithms in “normal” executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any wait-free algorithm that achieves approximate agreement among n
Hagit Attiya, Nancy A. Lynch, Nir Shavit
openaire   +2 more sources

Fast geometric algorithms.

2019
Ph. D.
openaire   +2 more sources

A fast algorithm for stereo matching

Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Review of Fast Algorithms and Hardware Implementations on Computer Holography

IEEE Transactions on Industrial Informatics, 2016
T. Shimobaba, T. Kakue, T. Ito
semanticscholar   +1 more source

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

IEEE Transactions on Image Processing, 2009
Amir Beck, M. Teboulle
semanticscholar   +1 more source