ARTÍCULO
TITULO

Algorithms - An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes

Hayashi    
T    
Nakano    
K    
Olariu    
S    

Resumen

No disponible

 Artículos similares

       
 
Ketan Dalal, Luc Devroye and Ebrahim Malalla    
Linear probing continues to be one of the best practical hashing algorithms due to its good average performance, efficiency, and simplicity of implementation. However, the worst-case performance of linear probing seems to degrade with high load factors d... ver más
Revista: Algorithms

 
Fernando Díaz-del-Río, Pablo Sanchez-Cuevas, María José Moron-Fernández, Daniel Cascado-Caballero, Helena Molina-Abril and Pedro Real    
Relating image contours and regions and their attributes according to connectivity based on incidence or adjacency is a crucial task in numerous applications in the fields of image processing, computer vision and pattern recognition. In this paper, the c... ver más
Revista: Algorithms

 
Irina Teryokhina     Pág. 21 - 27
The paper discusses the problem of process mining with further anomalies detection for constructed process models. The algorithms extension for the case of several running processes with some restrictions on their structure has been investigated. An acyc... ver más

 
Pengcheng Mu, Xin Zhang, Ping Qin and Bo He    
Simultaneous Localization and Mapping (SLAM) is a well-known solution for mapping and realizing autonomous navigation of an Autonomous Underwater Vehicle (AUV) in unknown underwater environments. However, the inaccurate time-varying observation noise wil... ver más

 
R.A. Elchenkov,M.E. Dunaev,K.S. Zaytsev     Pág. 62 - 69
The purpose of this work is to study methods for predicting the values of time series when processing streaming data in distributed systems in real time. To do this, the authors propose a modification of the autoregressive model with a given AR order by ... ver más