Results 1  10
of
14,186
Exact Analysis of Exact Change
, 1997
"... We consider the kpayment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k, w ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We consider the kpayment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k
Quantization
 IEEE TRANS. INFORM. THEORY
, 1998
"... The history of the theory and practice of quantization dates to 1948, although similar ideas had appeared in the literature as long ago as 1898. The fundamental role of quantization in modulation and analogtodigital conversion was first recognized during the early development of pulsecode modula ..."
Abstract

Cited by 884 (12 self)
 Add to MetaCart
modulation systems, especially in the 1948 paper of Oliver, Pierce, and Shannon. Also in 1948, Bennett published the first highresolution analysis of quantization and an exact analysis of quantization noise for Gaussian processes, and Shannon published the beginnings of rate distortion theory, which would
Robust principal component analysis?
 Journal of the ACM,
, 2011
"... Abstract This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a lowrank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the lowrank and the ..."
Abstract

Cited by 569 (26 self)
 Add to MetaCart
rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; among all feasible decompositions, simply minimize a weighted combination of the nuclear norm and of the 1 norm. This suggests the possibility of a principled approach to robust principal component
A comparative analysis of selection schemes used in genetic algorithms
 Foundations of Genetic Algorithms
, 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract

Cited by 531 (31 self)
 Add to MetaCart
or differential equations, which are verified through computer simulations. The analysis provides convenient approximate or exact solutions as well as useful convergence time and growth ratio estimates. The paper recommends practical application of the analyses and suggests a number of paths for more detailed
The Exact Analysis of Text
, 2007
"... More than forty years after its initial publication, Frederick Mosteller and David Wallace's Inference and Disputed Authorship: The Federalist is an excellent introduction to the application of exact techniques to various problems in the analysis of text; in some respects it is still unequaled. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
More than forty years after its initial publication, Frederick Mosteller and David Wallace's Inference and Disputed Authorship: The Federalist is an excellent introduction to the application of exact techniques to various problems in the analysis of text; in some respects it is still unequaled
Exact Analysis of Montgomery Multiplication
"... Abstract. The Montgomery multiplication is often used for an efficient implementations of publickey cryptosystems. This algorithm occasionally needs an extra subtraction in the final step, and the correlation of these subtractions can be considered as an invariant of the algorithm. Some side channe ..."
Abstract
 Add to MetaCart
Abstract. The Montgomery multiplication is often used for an efficient implementations of publickey cryptosystems. This algorithm occasionally needs an extra subtraction in the final step, and the correlation of these subtractions can be considered as an invariant of the algorithm. Some side channel attacks on cryptosystems using Montgomery Multiplication has been proposed applying the correlation estimated heuristically. In this paper, we theoretically analyze the properties of the final subtraction in Montgomery multiplication. We investigate the distribution of the outputs of multiplications in the fixed length interval included between 0 and the underlying modulus. Integrating these distributions, we present some proofs with a reasonable assumption for the appearance ratio of the final subtraction, which have been heuristically estimated by previous papers. Moreover, we present a new invariant of the final subtraction: x · y with y = 3x mod m, where m is the underlying modulus. Finally we show a possible attack on elliptic curve cryptosystems using this invariant.
TOTAL VARIANCE AS AN EXACT ANALYSIS OF THE
"... Given a sequence of fractional frequency deviates, we investigute the relationship between the sumple variance of these deviates and the total variance (Totvar) estimator of the Auan variance. We demonsirate that we cun recover exuctly twice the sample variance by renormalizing the Totvar estimator ..."
Abstract
 Add to MetaCart
Given a sequence of fractional frequency deviates, we investigute the relationship between the sumple variance of these deviates and the total variance (Totvar) estimator of the Auan variance. We demonsirate that we cun recover exuctly twice the sample variance by renormalizing the Totvar estimator and then summing it over dyadic averaging times 1, 2, 4,..., 2J along with one additional term that represents variations at all dyadic averaging times greuter than 2?. This decomposition of the sample variance mimics a similar theoretical decomposition in which summing the true Allan variance over all possible dyadic averaging times yields twice the process variance. We also establish a relationship between the Totvar estimator of the AUan vuriunce and a biased muximal overlap estimator that uses a circularized version of the original fractional frequency deviates. 1
Dynamic Bayesian Networks: Representation, Inference and Learning
, 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and biosequence analysis, and KFMs have bee ..."
Abstract

Cited by 770 (3 self)
 Add to MetaCart
) space instead of O(T); a simple way of using the junction tree algorithm for online inference in DBNs; new complexity bounds on exact online inference in DBNs; a new deterministic approximate inference algorithm called factored frontier; an analysis of the relationship between the BK algorithm and loopy
Imagenet: A largescale hierarchical image database
 In CVPR
, 2009
"... The explosion of image data on the Internet has the potential to foster more sophisticated and robust models and algorithms to index, retrieve, organize and interact with images and multimedia data. But exactly how such data can be harnessed and organized remains a critical problem. We introduce her ..."
Abstract

Cited by 840 (28 self)
 Add to MetaCart
The explosion of image data on the Internet has the potential to foster more sophisticated and robust models and algorithms to index, retrieve, organize and interact with images and multimedia data. But exactly how such data can be harnessed and organized remains a critical problem. We introduce
Greed is Good: Algorithmic Results for Sparse Approximation
, 2004
"... This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal representa ..."
Abstract

Cited by 916 (9 self)
 Add to MetaCart
representation of an exactly sparse signal. It leverages this theory to show that both OMP and BP succeed for every sparse input signal from a wide class of dictionaries. These quasiincoherent dictionaries offer a natural generalization of incoherent dictionaries, and the cumulative coherence function
Results 1  10
of
14,186