Sciweavers

2621 search results - page 379 / 525
» Near orders and codes
Sort
View
CORR
2006
Springer
111views Education» more  CORR 2006»
15 years 6 months ago
Universal decoding with an erasure option
Motivated by applications of rateless coding, decision feedback, and automatic repeat request (ARQ), we study the problem of universal decoding for unknown channels in the presence...
Neri Merhav, Meir Feder
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 6 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
ENTCS
2006
184views more  ENTCS 2006»
15 years 6 months ago
Scannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
Adam Megacz
ENTCS
2006
107views more  ENTCS 2006»
15 years 6 months ago
Exact and Portable Profiling for the JVM Using Bytecode Instruction Counting
This paper presents a novel profiling approach, which is entirely based on program transformation techniques in order to enable exact profiling, preserving complete call stacks, m...
Walter Binder, Jarle Hulaas
IANDC
2006
93views more  IANDC 2006»
15 years 6 months ago
Aperiodic propagation criteria for Boolean functions
We characterise the aperiodic autocorrelation for a Boolean function, f, and define the Aperiodic Propagation Criteria (APC) of degree l and order q. We establish the strong simil...
Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G...