ARTÍCULO
TITULO

SPECIAL ISSUE ON CODES AND GRAPHS AND ITERATIVE ALGORITHMS - PAPERS - Minimum-Distance Bounds by Graph Analysis

Tanner    
R M    

Resumen

No disponible

 Artículos similares

       
 
Theodore Andronikos and Alla Sirokofskich    
In the dynamic landscape of digital information, the rise of misinformation and fake news presents a pressing challenge. This paper takes a completely new approach to verifying news, inspired by how quantum actors can reach agreement even when they are s... ver más
Revista: Information

 
Damir Karabaic, Marko Kr?ulja, Sven Maricic and Lovro Liveric    
The most commonly used subsea pipeline installation method is the S-Lay method. A very important and complex task in an S-Lay installation engineering analysis is to find the optimal pipelay vessel installation configuration for every distinctive pipelin... ver más

 
Xi Duan, Jian Liu and Xinjie Wang    
The real-time simulation technology of large-scale open sea surfaces has been of great importance in fields such as computer graphics, ocean engineering, and national security. However, existing technologies typically have performance requirements or pla... ver más

 
Hans Ulrik Riisgård    
Sponges have always been filter feeders, in contrast to all the other filter-feeding invertebrate groups for which this feeding mode is a secondary adaptation. This study calls attention to this aspect, which explains why sponges are tolerant to hypoxia,... ver más

 
Tamás Kegyes, Alex Kummer, Zoltán Süle and János Abonyi    
We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go. We showed that both constrained shortest Hamiltonian pathfinding problems and disassembly line bal... ver más
Revista: Information