Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,023,265 papers from all fields of science
Search
Sign In
Create Free Account
Algorithmic efficiency
Known as:
Coding efficiency
, Code efficiency
, Computational cost
Expand
In computer science, algorithmic efficiency are the properties of an algorithm which relate to the amount of computational resources used by the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Analysis of algorithms
Backward compatibility
Best, worst and average case
Binary search algorithm
Expand
Broader (1)
Computer performance
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
A Computationally Efficient and Robust Implementation of the Continuous-Discrete Extended Kalman Filter
J. B. Jørgensen
,
P. G. Thomsen
,
H. Madsen
,
Morten Rode Kristensen
American Control Conference
2007
Corpus ID: 1067164
We present a novel numerically robust and computationally efficient extended Kalman filter for state estimation in nonlinear…
Expand
Highly Cited
2006
Highly Cited
2006
An Adaptive Background Model for Camshift Tracking with a Moving Camera
R. Stolkin
,
I. Florescu
,
G. Kamberov
2006
Corpus ID: 15634764
Continuously Adaptive Mean shift (CAMSHIFT) is a popular algorithm for visual tracking, providing speed and robustness with…
Expand
Highly Cited
2005
Highly Cited
2005
A Class of Pareto Archived Evolution Strategy Algorithms Using Immune Inspired Operators for Ab-Initio Protein Structure Prediction
V. Cutello
,
Giuseppe Narzisi
,
Giuseppe Nicosia
EvoWorkshops
2005
Corpus ID: 14664428
In this work we investigate the applicability of a multiobjective formulation of the Ab-Initio Protein Structure Prediction (PSP…
Expand
2001
2001
Linearity of X-band class-F power amplifiers in high-efficiency transmitters
M. Weiss
,
F. Raab
,
Z. Popović
2001
Corpus ID: 5566575
Modern communication signals have time-varying envelopes with significant peak-to-average ratios, resulting in low average…
Expand
Highly Cited
2000
Highly Cited
2000
Comparison of three Monte Carlo conformational search strategies for a proteinlike homopolymer model: Folding thermodynamics and identification of low-energy structures
D. Gront
,
A. Kolinski
,
J. Skolnick
2000
Corpus ID: 7583658
Entropy sampling Monte Carlo, the replica method, and the classical Metropolis scheme were applied in numerical studies of the…
Expand
Highly Cited
1999
Highly Cited
1999
Dithered signed-error CMA: robust, computationally efficient blind adaptive equalization
Philip Schniter
,
C. Johnson
IEEE Transactions on Signal Processing
1999
Corpus ID: 527741
Adaptive blind equalization has gained widespread use in communication systems that operate without training signals. In…
Expand
Highly Cited
1998
Highly Cited
1998
Atomistic Modeling of Point and Extended Defects in Crystalline Materials
M. Jaraíz
,
L. Pelaz
,
+5 authors
J. Poate
1998
Corpus ID: 54810091
Atomistic process modeling, a kinetic Monte Carlo simulation technique, has the interest of being both conceptually simple and…
Expand
Highly Cited
1996
Highly Cited
1996
Solvation energies and electronic spectra in polar, polarizable media: Simulation tests of dielectric continuum theory
J. Bader
,
B. Berne
1996
Corpus ID: 29460725
A dielectric continuum theory for the solvation of a polar molecule in a polar, polarizable solvent is tested using computer…
Expand
Highly Cited
1985
Highly Cited
1985
Frequency-domain implementations of periodically time-varying filters
E. Ferrara
IEEE Transactions on Acoustics Speech and Signal…
1985
Corpus ID: 33599
Cyclostationary random processes have statistics that vary periodically in time. Optimum filtering of cyclostationary signals…
Expand
1970
1970
Upper bound on the efficiency of dc-constrained codes
T. Chien
Bell Labs technical journal
1970
Corpus ID: 122893049
We derive the limiting efficiencies of dc-constrained codes. Given bounds on the running digital sum (RDS), the best possible…
Expand