Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,389
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract
-
Cited by 1513 (20 self)
- Add to MetaCart
Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear
Random Digit Representation of Integers
, 2015
"... Modular exponentiation is core to today’s main stream public key cryptographic systems. In this article, we generalize the classical fractional wNAF method for modular exponentiation – the classical method uses a digit set of the form {1, 3,...,m} which is extended here to any set of odd integers of ..."
Abstract
- Add to MetaCart
of the form {1, d2,..., dn}. We give a formula for the average density of non-zero terms in this new representation and discuss its asymptotic behavior when those digits are randomly chosen from a given set. We also propose a specific method for the precomputation phase of the exponentiation algorithm. 1
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- SIAM J. on Computing
, 1997
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract
-
Cited by 1277 (4 self)
- Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Secure spread spectrum watermarking for multimedia
- IEEE TRANSACTIONS ON IMAGE PROCESSING
, 1997
"... This paper presents a secure (tamper-resistant) algorithm for watermarking images, and a methodology for digital watermarking that may be generalized to audio, video, and multimedia data. We advocate that a watermark should be constructed as an independent and identically distributed (i.i.d.) Gauss ..."
Abstract
-
Cited by 1100 (10 self)
- Add to MetaCart
This paper presents a secure (tamper-resistant) algorithm for watermarking images, and a methodology for digital watermarking that may be generalized to audio, video, and multimedia data. We advocate that a watermark should be constructed as an independent and identically distributed (i
Image denoising using a scale mixture of Gaussians in the wavelet domain
- IEEE TRANS IMAGE PROCESSING
, 2003
"... We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian vecto ..."
Abstract
-
Cited by 513 (17 self)
- Add to MetaCart
We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coefficients at adjacent positions and scales are modeled as the product of two independent random variables: a Gaussian
Factor Graphs and the Sum-Product Algorithm
- IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract
-
Cited by 1791 (69 self)
- Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
Stable signal recovery from incomplete and inaccurate measurements,”
- Comm. Pure Appl. Math.,
, 2006
"... Abstract Suppose we wish to recover a vector x 0 ∈ R m (e.g., a digital signal or image) from incomplete and contaminated observations y = Ax 0 + e; A is an n × m matrix with far fewer rows than columns (n m) and e is an error term. Is it possible to recover x 0 accurately based on the data y? To r ..."
Abstract
-
Cited by 1397 (38 self)
- Add to MetaCart
Abstract Suppose we wish to recover a vector x 0 ∈ R m (e.g., a digital signal or image) from incomplete and contaminated observations y = Ax 0 + e; A is an n × m matrix with far fewer rows than columns (n m) and e is an error term. Is it possible to recover x 0 accurately based on the data y
The Wiener Index of Random Digital Trees
, 2012
"... The Wiener index has been studied for simply generated random trees, non-plane unlabeled random trees and a huge subclass of random grid trees containing random binary search trees, random medianof-(2k + 1) search trees, random m-ary search trees, random quadtrees, random simplex trees, etc. An impo ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
. An important class of random trees for which the Wiener index was not studied so far are random digital trees. In this work, we close this gap. More precisely, we derive asymptotic expansions of moments of the Wiener index and show that a central limit law for the Wiener index holds. These results are obtained
Distances in random digital search trees
, 2006
"... Distances between nodes in random trees is a popular topic, and several classes of trees have recently been investigated. We look into this matter in digital search trees. By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of the ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Distances between nodes in random trees is a popular topic, and several classes of trees have recently been investigated. We look into this matter in digital search trees. By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments
Random digit dialing: A comparison to personal surveys
- Public Opinion Quarterly
, 1978
"... D'URING the past few years, a minor revolution has taken place in survey research. Telephone surveys based on some form of random digit dialing (RDD) have gained general acceptance among much of the survey community as a legitimate method for sampling public opinion. Not too long ago, telephone ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
D'URING the past few years, a minor revolution has taken place in survey research. Telephone surveys based on some form of random digit dialing (RDD) have gained general acceptance among much of the survey community as a legitimate method for sampling public opinion. Not too long ago
Results 1 - 10
of
4,389
