Sciweavers

212 search results - page 8 / 43
» On the Locality of Codeword Symbols
Sort
View
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
14 years 3 days ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
HUC
2007
Springer
14 years 2 months ago
Symbolic Object Localization Through Active Sampling of Acceleration and Sound Signatures
We describe a novel method for symbolic location discovery of simple objects. The method requires no infrastructure and relies on simple sensors routinely used in sensor nodes and ...
Kai S. Kunze, Paul Lukowicz
BMVC
1998
13 years 10 months ago
ORASSYLL: Object Recognition with Autonomously Learned and Sparse Symbolic Representations Based on Local Line Detectors
We introduce an object recognition system in which objects are represented as a sparse and spatially organized set of local (bent) line segments. The line segments correspond to b...
Norbert Krüger, Niklas Lüdtke
APPROX
2006
Springer
100views Algorithms» more  APPROX 2006»
14 years 9 days ago
Robust Local Testability of Tensor Products of LDPC Codes
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
Irit Dinur, Madhu Sudan, Avi Wigderson
TIT
2011
119views more  TIT 2011»
13 years 3 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer