Sciweavers

436 search results - page 12 / 88
» On two variations of identifying codes
Sort
View
ESORICS
2004
Springer
15 years 3 months ago
Comparison Between Two Practical Mix Designs
We evaluate the anonymity provided by two popular email mix implementations, Mixmaster and Reliable, and compare their effectiveness through the use of simulations which model th...
Claudia Díaz, Len Sassaman, Evelyne Dewitte
JMLR
2006
96views more  JMLR 2006»
14 years 9 months ago
Rearrangement Clustering: Pitfalls, Remedies, and Applications
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
Sharlee Climer, Weixiong Zhang
BMCBI
2010
148views more  BMCBI 2010»
14 years 10 months ago
Calling SNPs without a reference sequence
Background: The most common application for the next-generation sequencing technologies is resequencing, where short reads from the genome of an individual are aligned to a refere...
Aakrosh Ratan, Yu Zhang, Vanessa M. Hayes, Stephan...
ICIP
2000
IEEE
15 years 11 months ago
Hierarchical Representation and Coding of Surfaces Using 3D Polygon Meshes
This paper presents a novel procedure for the representation and coding of 3D surfaces using hierarchical adaptive triangulation. The proposed procedure is based on pyramidal anal...
Ioannis Kompatsiaris, Michael G. Strintzis
TIT
2008
87views more  TIT 2008»
14 years 9 months ago
Coding Theorems on the Threshold Scheme for a General Source
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
Hiroki Koga