Sciweavers

1236 search results - page 43 / 248
» fast 2010
Sort
View
137
Voted
DCC
2010
IEEE
15 years 10 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
106
Voted
ASM
2010
ASM
15 years 10 months ago
Alloy+HotCore: A Fast Approximation to Unsat Core
Identifying a minimal unsatisfiable core in an Alloy model proved to be a very useful feature in many scenarios. We extend this concept to hot core, an approximation to unsat core...
Nicolás D'Ippolito, Marcelo F. Frias, Juan ...
123
Voted
CVPR
2010
IEEE
15 years 9 months ago
Fast Sparse Representation with Prototypes
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
Jia-Bin Huang, Ming-Hsuan Yang
CSR
2010
Springer
15 years 8 months ago
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
Pawel Gawrychowski, Artur Jez, Lukasz Jez
132
Voted
FSE
2010
Springer
180views Cryptology» more  FSE 2010»
15 years 8 months ago
Fast Software AES Encryption
This paper presents new software speed records for AES-128 encryption for architectures at both ends of the performance spectrum. On the one side we target the low-end 8-bit AVR mi...
Dag Arne Osvik, Joppe W. Bos, Deian Stefan, David ...