Sciweavers

1245 search results - page 51 / 249
» Binary Sparse Coding
Sort
View
144
Voted
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 2 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
119
Voted
ACSAC
2006
IEEE
15 years 8 months ago
Static Detection of Vulnerabilities in x86 Executables
In the last few years, several approaches have been proposed to perform vulnerability analysis of applications written in high-level languages. However, little has been done to au...
Marco Cova, Viktoria Felmetsger, Greg Banks, Giova...
DM
2007
103views more  DM 2007»
15 years 2 months ago
Codes from the line graphs of complete multipartite graphs and PD-sets
The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are fo...
Jennifer D. Key, P. Seneviratne
82
Voted
TIT
2008
82views more  TIT 2008»
15 years 2 months ago
Error Control Codes for Parallel Asymmetric Channels
We introduce and study error correcting codes for parallel synchronous communication via asymmetric channels. Constructions for error detecting/correcting codes are presented. Mor...
Rudolf Ahlswede, Harout K. Aydinian
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 2 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg