Sciweavers

2634 search results - page 28 / 527
» Faster Than Uppaal
Sort
View

Presentation
439views
12 years 1 months ago
Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 10 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
CVPR
2012
IEEE
11 years 10 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
AAAI
2012
11 years 10 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
AFRICACRYPT
2011
Springer
12 years 11 months ago
Really Fast Syndrome-Based Hashing
Abstract. The FSB (fast syndrome-based) hash function was submitted to the SHA-3 competition by Augot, Finiasz, Gaborit, Manuel, and Sendrier in 2008, after preliminary designs pro...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...