Sciweavers

1245 search results - page 201 / 249
» Binary Sparse Coding
Sort
View
CL
2006
Springer
15 years 3 months ago
Runtime bytecode transformation for Smalltalk
Transforming programs to alter their semantics is of wide interest, for purposes as diverse as off-the-shelf component adaptation, optimization,tracegeneration,andexperimentationw...
Marcus Denker, Stéphane Ducasse, Éri...
JSA
2006
131views more  JSA 2006»
15 years 2 months ago
Bidirectional liveness analysis, or how less than half of the Alpha's registers are used
Interprocedural data flow analyses of executable programs suffer from the conservative assumptions that need to be made because no precise control flow graph is available and beca...
Bjorn De Sutter, Bruno De Bus, Koen De Bosschere
TCS
1998
15 years 2 months ago
Merit Factors and Morse Sequences
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...
T. Downarowicz, Y. Lacroix
CORR
2011
Springer
200views Education» more  CORR 2011»
14 years 10 months ago
Beating the Gilbert-Varshamov Bound for Online Channels
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
Ishay Haviv, Michael Langberg
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
13 years 5 months ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett