Sciweavers

1245 search results - page 13 / 249
» Binary Sparse Coding
Sort
View
ALT
2008
Springer
14 years 6 months ago
Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
Andreas Maurer, Massimiliano Pontil
EUROPAR
1997
Springer
14 years 1 months ago
A Relational Approach to the Compilation of Sparse Matrix Programs
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...
Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
WCRE
2002
IEEE
14 years 2 months ago
Analysis of Virtual Method Invocation for Binary Translation
The University of Queensland Binary Translator (UQBT ) is a static binary translation framework that allows for the translation of binary, executable programs, from one architectu...
Jens Tröger, Cristina Cifuentes
WETICE
1999
IEEE
14 years 1 months ago
Static Analysis of Binary Code to Isolate Malicious Behaviors
In this paper, we address the problem of static slicing on binary executables for the purposes of the malicious code detection in COTS components. By operating directly on binary ...
J. Bergeron, Mourad Debbabi, M. M. Erhioui, B&eacu...
CORR
1999
Springer
111views Education» more  CORR 1999»
13 years 9 months ago
On Bounded-Weight Error-Correcting Codes
: This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to th...
Russell Bent, Michael Schear, Lane A. Hemaspaandra...