Sciweavers

4355 search results - page 295 / 871
» Increasing Kolmogorov Complexity
Sort
View
ISVC
2007
Springer
16 years 27 days ago
Tensor Lines in Tensor Fields of Arbitrary Order
This paper presents a method to reduce time complexity of the computation of higher–order tensor lines. The method can be applied to higher–order tensors and the spherical harm...
Mario Hlawitschka, Gerik Scheuermann, Alfred Anwan...
LCPC
2007
Springer
16 years 27 days ago
Compiler-Enhanced Incremental Checkpointing
As modern supercomputing systems reach the peta-flop performance range, they grow in both size and complexity. This makes them increasingly vulnerable to failures from a variety o...
Greg Bronevetsky, Daniel Marques, Keshav Pingali, ...
MCAM
2007
Springer
156views Multimedia» more  MCAM 2007»
16 years 27 days ago
Fast Mode Decision by Exploiting Spatio-temporal Correlation in H.264
The H.264 video coding standard provides considerably higher coding efficiency than those of previous standards but its complexity is significantly increased. In this paper, we pro...
Sung-Hoon Jeon, Tak-Gi Lee, Kwang-Mu Shin, Sung-Mi...
OTM
2007
Springer
16 years 27 days ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
PPAM
2007
Springer
16 years 26 days ago
An Extensible Timing Infrastructure for Adaptive Large-Scale Applications
Real-time access to accurate and reliable timing information is necessary to profile scientific applications, and crucial as simulations become increasingly complex, adaptive, an...
Dylan Stark, Gabrielle Allen, Tom Goodale, Thomas ...