Sciweavers

374 search results - page 17 / 75
» Fast separable factorization and applications
Sort
View
ACSAC
2010
IEEE
13 years 5 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
ICCAD
2005
IEEE
106views Hardware» more  ICCAD 2005»
14 years 1 months ago
Fast balanced stochastic truncation via a quadratic extension of the alternating direction implicit iteration
— Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT pro...
Ngai Wong, Venkataramanan Balakrishnan
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 10 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
14 years 1 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
ICASSP
2011
IEEE
12 years 11 months ago
A fast projected gradient optimization method for real-time perception-based clipping of audio signals
Clipping is a necessary signal processing operation in many realtime audio applications, yet it often reduces the sound quality of the signal. The recently proposed perception-bas...
Bruno Defraene, Toon van Waterschoot, Moritz Diehl...