Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,636,721 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
SparSpec: a new method for fitting multiple sinusoids with irregularly sampled data
S. Bourguignon
,
H. Carfantan
,
T. Böhm
2007
Corpus ID: 14813167
Context. The location of pure frequencies in the spectrum of an irregularly sampled time series is an important topic in…
Expand
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
2000
Highly Cited
2000
Fine granularity scalability in MPEG-4 for streaming video
Weiping Li
,
Fan Ling
,
Xuemin Chen
IEEE International Symposium on Circuits and…
2000
Corpus ID: 43489375
This paper describes the bitplane coding technique to achieve fine granularity scalability (FGS) in MPEG-4. It reports its coding…
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
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
1998
Highly Cited
1998
An efficient mel-LPC analysis method for speech recognition
H. Matsumoto
,
Y. Nakatoh
,
Y. Furuhata
ICSLP
1998
Corpus ID: 18456214
This paper proposes a simple and e(cid:14)cient time domain technique to estimate an all-poll model on a mel-frequency axis (Mel…
Expand
Highly Cited
1996
Highly Cited
1996
Towards (cid:1)D Hand Tracking using a Deformable Model
T. Heap
,
David C. Hogg
1996
Corpus ID: 2267948
In this paper we (cid:3)rst describe how we have constructed a (cid:4)D deformable Point Distribution Model of the human hand(cid…
Expand
Highly Cited
1996
Highly Cited
1996
Structural and vibrational properties of fullerenes and nanotubes in a nonorthogonal tight‐binding scheme
M. Menon
,
E. Richter
,
K. Subbaswamy
1996
Corpus ID: 31052748
A simple, computationally efficient method for the evaluation of structural and vibrational properties of carbon is presented…
Expand
Highly Cited
1985
Highly Cited
1985
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
A. Esfahanian
,
S. Hakimi
IEEE transactions on computers
1985
Corpus ID: 8854940
A class of communication networks which is suitable for "multiple processor systems" was studied by Pradhan and Reddy. The…
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