Results 1  10
of
413,029
Approximating the Distortion ∗
"... Kenyon et al. (STOC 04) compute the distortion between onedimensional finite point sets when the distortion is small; Papadimitriou and Safra (SODA 05) show that the problem is NPhard to approximate within a factor of 3, albeit in 3 dimensions. We solve an open problem in these two papers by demon ..."
Abstract
 Add to MetaCart
Kenyon et al. (STOC 04) compute the distortion between onedimensional finite point sets when the distortion is small; Papadimitriou and Safra (SODA 05) show that the problem is NPhard to approximate within a factor of 3, albeit in 3 dimensions. We solve an open problem in these two papers
Approximating additive distortion of . . .
, 2004
"... We consider the problem of fitting metric data consisting of n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive distortion is the sum of errors in all pairwise distances in the input data. This problem has been shown to b ..."
Abstract
 Add to MetaCart
to be NPhard by [13]. We give an O(log n) approximation for this problem by using Garg et al.'s [10] algorithm for the multicut problem as a subroutine. Our algorithm also gives an O(log1/p n) approximation for the Lp norm of the additive distortion.
Approximating Average Distortion of Embeddings into Line
, 2003
"... elative #. vs Relative Bounds Absolute Bounds Best guarantee about "worst case" distortion. Guarantee on distortion is independent of input metric. Relative Bound Given, as input, a finite metric, embed it into the host metric to (approximately) minimize distortion. [cf. Ravi's Talk ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
elative #. vs Relative Bounds Absolute Bounds Best guarantee about "worst case" distortion. Guarantee on distortion is independent of input metric. Relative Bound Given, as input, a finite metric, embed it into the host metric to (approximately) minimize distortion. [cf. Ravi
BitRate Control Using Piecewise Approximated Rate–Distortion Characteristics
"... Bitrate control using piecewise approximated ratedistortion characteristics ..."
Abstract
 Add to MetaCart
Bitrate control using piecewise approximated ratedistortion characteristics
Approximating ratedistortion graphs of individual data
 Experiments in lossy compression and denoising,” IEEE Trans. Comput., Submitted. Also: Arxiv preprint cs.IT/0609121
, 2006
"... Abstract—Classical ratedistortion theory requires specifying a source distribution. Instead, we analyze ratedistortion properties of individual objects using the recently developed algorithmic ratedistortion theory. The latter is based on the noncomputable notion of Kolmogorov complexity. To appl ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Abstract—Classical ratedistortion theory requires specifying a source distribution. Instead, we analyze ratedistortion properties of individual objects using the recently developed algorithmic ratedistortion theory. The latter is based on the noncomputable notion of Kolmogorov complexity
Approximating Additive Distortion of Embeddings into Line Metrics
 7TH INTERNATIONAL WORKSHOP ON APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS (APPROX
, 2004
"... We consider the problem of fitting metric data consisting of n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive distortion is the sum of errors in all pairwise distances in the input data. This problem has been shown t ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
to be NPhard by [13]. We give an O(log n) approximation for this problem by using Garg et al.'s [10] algorithm for the multicut problem as a subroutine. Our algorithm also gives an O(log n) approximation for the Lp norm of the additive distortion.
A new scale of social desirability independent of psychopathology
 Journal of Consulting Psychology
, 1960
"... It has long been recognized that personality test scores are influenced by nontestrelevant response determinants. Wiggins and Rumrill (1959) distinguish three approaches to this problem. Briefly, interest in the problem of response distortion has been concerned with attempts at statistical correct ..."
Abstract

Cited by 656 (1 self)
 Add to MetaCart
It has long been recognized that personality test scores are influenced by nontestrelevant response determinants. Wiggins and Rumrill (1959) distinguish three approaches to this problem. Briefly, interest in the problem of response distortion has been concerned with attempts at statistical
Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding
 IEEE TRANS. ON INFORMATION THEORY
, 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing informationembedding rate, mini ..."
Abstract

Cited by 495 (15 self)
 Add to MetaCart
, minimizing distortion between the host signal and composite signal, and maximizing the robustness of the embedding. We introduce new classes of embedding methods, termed quantization index modulation (QIM) and distortioncompensated QIM (DCQIM), and develop convenient realizations in the form of what we
Flexible camera calibration by viewing a plane from unknown orientations
, 1999
"... We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled ..."
Abstract

Cited by 512 (7 self)
 Add to MetaCart
We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion
Blind Beamforming for Non Gaussian Signals
 IEE ProceedingsF
, 1993
"... This paper considers an application of blind identification to beamforming. The key point is to use estimates of directional vectors rather than resorting to their hypothesized value. By using estimates of the directional vectors obtained via blind identification i.e. without knowing the arrray mani ..."
Abstract

Cited by 704 (31 self)
 Add to MetaCart
manifold, beamforming is made robust with respect to array deformations, distortion of the wave front, pointing errors, etc ... so that neither array calibration nor physical modeling are necessary. Rather surprisingly, `blind beamformers' may outperform `informed beamformers' in a plausible
Results 1  10
of
413,029