ARTÍCULO
TITULO

Efficient Algorithms for Description Problems over Finite Totally Ordered Domains

Ángel J. Gil    
Miki Hermann    
Gernot Salzer    
and Bruno Zanuttini    

Resumen

No disponible

 Artículos similares

       
 
Diana Bratic, Marko ?apina, Denis Jurecic and Jana ?iljak Gr?ic    
This paper addresses the challenges associated with the centralized storage of educational materials in the context of a fragmented and disparate database. In response to the increasing demands of modern education, efficient and accessible retrieval of m... ver más

 
Li Li and Kyung Soo Jun    
River flood routing computes changes in the shape of a flood wave over time as it travels downstream along a river. Conventional flood routing models, especially hydrodynamic models, require a high quality and quantity of input data, such as measured hyd... ver más
Revista: Water

 
Marco Scutari    
Bayesian networks (BNs) are a foundational model in machine learning and causal inference. Their graphical structure can handle high-dimensional problems, divide them into a sparse collection of smaller ones, underlies Judea Pearl?s causality, and determ... ver más
Revista: Algorithms

 
Vincenzo Manca    
A symbolic analysis of Archimedes?s periodical number system is developed, from which a natural link emerges with the modern positional number systems with zero. After the publication of Fibonacci?s Liber Abaci, the decimal Indo-Arabic positional system ... ver más
Revista: Algorithms

 
Santiago Moreno-Carbonell and Eugenio F. Sánchez-Úbeda    
The Linear Hinges Model (LHM) is an efficient approach to flexible and robust one-dimensional curve fitting under stringent high-noise conditions. However, it was initially designed to run in a single-core processor, accessing the whole input dataset. Th... ver más
Revista: Algorithms