Sciweavers

2020 search results - page 83 / 404
» Speeding up Slicing
Sort
View
ICASSP
2009
IEEE
14 years 1 months ago
Generating high performance pruned FFT implementations
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
Franz Franchetti, Markus Püschel
AIPS
2008
14 years 10 days ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
DAGM
2008
Springer
13 years 11 months ago
Sliding-Windows for Rapid Object Class Localization: A Parallel Technique
Abstract. This paper presents a fast object class localization framework implemented on a data parallel architecture currently available in recent computers. Our case study, the im...
Christian Wojek, Gyuri Dorkó, André ...
ECAI
2010
Springer
13 years 11 months ago
Context-Specific Independence in Directed Relational Probabilistic Models and its Influence on the Efficiency of Gibbs Sampling
Abstract. There is currently a large interest in relational probabilistic models. While the concept of context-specific independence (CSI) has been well-studied for models such as ...
Daan Fierens
CGF
2010
128views more  CGF 2010»
13 years 10 months ago
An Optimizing Compiler for Automatic Shader Bounding
Programmable shading provides artistic control over materials and geometry, but the black box nature of shaders makes some rendering optimizations difficult to apply. In many case...
Petrik Clarberg, Robert Toth, Jon Hasselgren, Toma...