Results 281 to 290 of about 459,449 (308)

Efficient variants of the ICP algorithm

Proceedings Third International Conference on 3-D Digital Imaging and Modeling, 2002
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minimization strategy.
Szymon Rusinkiewicz, Marc Levoy
openaire   +1 more source

Efficient Algorithms for Eulerian Extension

2010
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in scheduling and routing and are closely related to the CHINESE POSTMAN and RURAL POSTMAN problems. Our main result is to show that the NP-hard WEIGHTED MULTIGRAPH EULERIAN EXTENSION
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller   +3 more
openaire   +1 more source

Efficient Distributed Algorithms

2022
openaire   +1 more source

An Overview of Machine Learning-Based Energy-Efficient Routing Algorithms in Wireless Sensor Networks

Electronics (Switzerland), 2021
Rongbo Zhu, Maode Ma, Ma Maode
exaly  

Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography

Mathematics, 2021
Sedat Akleylek, Cheng-Chi Lee, Hami Satilmiş   +2 more
exaly  

I/O-Efficient Algorithms on Triangle Listing and Counting

ACM Transactions on Database Systems, 2014
Xiaocheng Hu, Yufei Tao, Chin-Wan Chung   +2 more
exaly  

Energy-Efficient Network Navigation Algorithms

IEEE Journal on Selected Areas in Communications, 2015
Wenhan Dai, Yuan Shen, Moe Z Win
exaly  

Efficient parallel clustering algorithms

Informatica (Slovenia), 2002
Summary: Given a set \(P\) of \(n\) points in two dimensions, the aim of a clustering algorithm is to find a subset of \(k\) points such that some measure for this subject is minimized. We present efficient parallel algorithms for two clustering problems, namely, (i) a \(k\)-point subset with minimum \(L_\infty\)-diameter and (ii) a \(k\)-point subset ...
openaire   +1 more source

Algorithm 447: efficient algorithms for graph manipulation

Communications of the ACM, 1973
John Hopcroft, Robert Tarjan
exaly  

Comparison of area-efficient FFT algorithms for DVB-T2 receivers

Electronics Letters, 2010
A Cortes, Juan F Sevillano, Igone Velez   +2 more
exaly