Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,081,333 papers from all fields of science
Search
Sign In
Create Free Account
Averaging argument
In computational complexity theory and cryptography, averaging argument is a standard argument for proving theorems. It usually allows us to convert…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Ciphertext indistinguishability
Computational complexity theory
Cryptography
Predicate (mathematical logic)
Expand
Broader (1)
Circuit complexity
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Application of DTW Barycenter Averaging to Finding EEG Consensus Sequences
Levi C Davis
2016
Corpus ID: 14872203
DTW Barycenter Averaging (DBA) has proven to be a useful tool for calculating consensus sequences, but it has not yet been…
Expand
2011
2011
Using a power-dependent small-signal model for stability analysis in resonant dimming ballasts for fluorescent lamps
J. Ribas
,
R. E. Díaz
,
+4 authors
D. Gacio
Annual Conference of the IEEE Industrial…
2011
Corpus ID: 29115274
One important aspect for the design of dimming ballasts for fluorescent lamps is the output power range that can be obtained…
Expand
2011
2011
Computationally Efficient DOA and Polarization Estimation of Coherent Sources with Linear Electromagnetic Vector-Sensor Array
Zhaoting Liu
,
Jing-bo He
,
Zhong Liu
EURASIP Journal on Advances in Signal Processing
2011
Corpus ID: 3347192
This paper studies the problem of direction finding and polarization estimation of coherent sources using a uniform linear…
Expand
2008
2008
Advanced Approximation Algorithms (CMU 15-854B, Spring 2008) Lecture 11: Group Steiner Tree Gaps and Hardness
2008
Corpus ID: 15231723
2002
2002
The Euclidean Distortion of Complete Binary Trees
N. Linial
,
M. Saks
Discrete & Computational Geometry
2002
Corpus ID: 33364229
Abstract. Bourgain [1] showed that every embedding of the complete binary tree of depth n into l2 has metric distortion ≥ $\Omega…
Expand
1997
1997
Converting weather radar data to Cartesian space : A new approach using DISPLACE averaging
M. Mittermaier
,
D. Terblanche
1997
Corpus ID: 99336920
Volume-scan radar data can be processed to display radar rainfall fields on constant altitude planes. These displays are called…
Expand
1996
1996
Ears of triangulations and Catalan numbers
F. Hurtado
,
M. Noy
Discrete Mathematics
1996
Corpus ID: 20704049
1996
1996
Evaluating approximately balanced parity-declustered data layouts for disk arrays
E. Schwabe
,
Ian M. Sutherland
,
Bruce K. Holmer
Workshop on I/O in Parallel and Distributed…
1996
Corpus ID: 15551761
Abstract Parity-declustered data layouts were developed to reduce the time for on-line failure recovery in disk arrays. They…
Expand
1995
1995
Correlation estimators based on simple nonlinear transformations
M. C. Sullivan
,
E. Wegman
IEEE Transactions on Signal Processing
1995
Corpus ID: 27503249
The computational cost of estimating correlations may be reduced by employing sums of simple nonlinear functions of the data. A…
Expand
1986
1986
METHODS FOR ESTIMATING PASTURE DRY MATTER ON DAIRY FARMS IN NORTHLAND
G. J. Piggot
1986
Corpus ID: 56267718
Pasture dry matter (DM) estimates are used by dairy farmers and their advisers for feed planmng principally during April to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE