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...
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
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...
—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...
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...
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...
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...
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...
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...