Sciweavers

406 search results - page 7 / 82
» Identifying Codes and Covering Problems
Sort
View
ACNS
2006
Springer
148views Cryptology» more  ACNS 2006»
14 years 15 days ago
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
Dongvu Tonien, Reihaneh Safavi-Naini
APBC
2004
132views Bioinformatics» more  APBC 2004»
13 years 10 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
ICDE
2010
IEEE
193views Database» more  ICDE 2010»
14 years 3 months ago
Schema covering: a step towards enabling reuse in information integration
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
Barna Saha, Ioana Stanoi, Kenneth L. Clarkson
BMCBI
2005
127views more  BMCBI 2005»
13 years 8 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin
ICDCS
2010
IEEE
13 years 10 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao