Sciweavers

SI3D
2012
ACM
12 years 17 days ago
Surface based anti-aliasing
We present surface based anti-aliasing (SBAA), a new approach to real-time anti-aliasing for deferred renderers that improves the performance and lowers the memory requirements fo...
Marco Salvi, Kiril Vidimce
ICASSP
2011
IEEE
12 years 8 months ago
Low-complexity predictive lossy compression of hyperspectral and ultraspectral images
Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but its complexity and mem...
Andrea Abrardo, Mauro Barni, Enrico Magli
FSE
2011
Springer
218views Cryptology» more  FSE 2011»
12 years 8 months ago
Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describe a method to construct a collision in the compression function of ECHO-256 reduced to fou...
Jérémy Jean, Pierre-Alain Fouque
ICASSP
2011
IEEE
12 years 8 months ago
Efficient context adaptive entropy coding for real-time applications
Context based entropy coding has the potential to provide higher gain over memoryless entropy coding. However serious difficulties arise regarding the practical implementation in...
Guillaume Fuchs, Vignesh Subbaraman, Markus Multru...
SGAI
2010
Springer
13 years 2 months ago
Hierarchical Traces for Reduced NSM Memory Requirements
This paper presents work on using hierarchical long term memory to reduce the memory requirements of nearest sequence memory (NSM) learning, a previously published, instance-based ...
Torbjørn S. Dahl
CGF
2010
147views more  CGF 2010»
13 years 5 months ago
Resampling Strategies for Deforming MLS Surfaces
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
Joao Paulo Gois, Gustavo C. Buscaglia
WSCG
2000
153views more  WSCG 2000»
13 years 6 months ago
RaFSi - A Fast Watershed Algorithm Based on Rainfalling Simulation
In this paper, we present a fast watershed algorithm based on the rainfalling simulation. We present the various techniques and data structures utilized in our approach. Throughou...
Stanislav L. Stoev
JSSPP
1995
Springer
13 years 8 months ago
The Interaction between Memory Allocation and Adaptive Partitioning in Message-Passing Multicomputers
Abstract. Most studies on adaptive partitioning policies for scheduling parallel jobs on distributed memory parallel computers ignore the constraints imposed by the memory requirem...
Sanjeev Setia
EUROPAR
2006
Springer
13 years 8 months ago
Tying Memory Management to Parallel Programming Models
Stand-alone threading libraries lack sophisticated memory management techniques. In this paper, we present a methodology that allows threading libraries that implement non-preempti...
Ioannis E. Venetis, Theodore S. Papatheodorou
DSD
2004
IEEE
111views Hardware» more  DSD 2004»
13 years 8 months ago
Memory Requirement Optimization with Loop Fusion and Loop Shifting
Loop fusion and loop shifting are well recognized loop transformations for memory requirement reduction. Stateof-the-art optimizations with loop fusion and shifting are based on h...
Qubo Hu, Martin Palkovic, Per Gunnar Kjeldsberg