Sciweavers

MEDIAFORENSICS
2010
13 years 11 months ago
On the embedding capacity of DNA strands under substitution, insertion, and deletion mutations
A number of methods have been proposed over the last decade for embedding information within deoxyribonucleic acid (DNA). Since a DNA sequence is conceptually equivalent to a unid...
Félix Balado
JOC
2010
106views more  JOC 2010»
13 years 11 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske
DM
2010
103views more  DM 2010»
13 years 11 months ago
The hyperplanes of DQ-(7, k) arising from embedding
We determine all hyperplanes of the dual polar space DQ−(7, K) which arise from embedding. This extends one of the results of [5] to the infinite case.
Bart De Bruyn
PRL
2007
107views more  PRL 2007»
13 years 12 months ago
Robust SS watermarking with improved capacity
Robustness is a key attribute of spread spectrum (SS) watermarking scheme. It is significantly deteriorated if one tries to achieve high embedding rate keeping other parameters u...
Santi P. Maity, Malay K. Kundu, Tirtha S. Das
PAMI
2007
154views more  PAMI 2007»
13 years 12 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
DM
1998
94views more  DM 1998»
14 years 3 days ago
On embedding complete graphs into hypercubes
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
Michael Klugerman, Alexander Russell, Ravi Sundara...
ENTCS
2000
83views more  ENTCS 2000»
14 years 8 days ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf
JEI
2007
88views more  JEI 2007»
14 years 10 days ago
Wavelet-based fragile watermarking scheme for image authentication
In this work, we propose a novel fragile watermarking scheme in wavelet transform domain, which is sensitive to all kinds of manipulations and has the ability to localize the tamp...
Chang-Tsun Li, Huayin Si
TDHMS
2008
14 years 10 days ago
Constructing Good Covering Codes for Applications in Steganography
Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes c...
Jürgen Bierbrauer, Jessica J. Fridrich
TALG
2008
81views more  TALG 2008»
14 years 10 days ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...