Sciweavers

215 search results - page 24 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
DIMVA
2009
15 years 25 days ago
Polymorphing Software by Randomizing Data Structure Layout
Abstract. This paper introduces a new software polymorphism technique that randomizes program data structure layout. This technique will generate different data structure layouts f...
Zhiqiang Lin, Ryan Riley, Dongyan Xu
CHES
2007
Springer
115views Cryptology» more  CHES 2007»
15 years 6 months ago
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when...
Marc Joye
RECOMB
2004
Springer
16 years 1 days ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
ICASSP
2011
IEEE
14 years 3 months ago
Equiangular tight frame fingerprinting codes
We show that equiangular tight frames (ETFs) are particularly well suited as additive fingerprint designs against Gaussian averaging collusion attacks when the number of users is...
Dustin G. Mixon, Christopher J. Quinn, Negar Kiyav...
IPSN
2004
Springer
15 years 5 months ago
How to distribute sensors in a random field?
In this paper, we study the optimal way of distributing sensors in a random field to minimize the estimation distortion. We show that this problem is equivalent to certain proble...
Xin Zhang, Stephen B. Wicker