Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,362,261 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.
2009
2009
Improving view rendering quality and coding efficiency by suppressing compression artifacts in depth-image coding
PoLin Lai
,
Antonio Ortega
,
Camilo C. Dorea
,
P. Yin
,
C. Gomila
Electronic imaging
2009
Corpus ID: 15374313
We consider the effect of depth-image compression artifacts on the quality of virtual views rendered using neighboring views…
Expand
Highly Cited
2005
Highly Cited
2005
A new method for design of robust digital circuits
D. Patil
,
Sunghee Yun
,
Seung-Jean Kim
,
Alvin Cheung
,
M. Horowitz
,
Stephen P. Boyd
IEEE International Symposium on Quality…
2005
Corpus ID: 14499605
As technology continues to scale beyond 100 nm, there is a significant increase in performance uncertainty of CMOS logic due to…
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
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
1997
1997
Dissipative particle dynamics for interacting multicomponent systems
P. Coveney
,
P. Español
1997
Corpus ID: 3025655
We formulate the dissipative particle dynamics technique for multicomponent interacting systems and show that the important…
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
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
Highly Cited
1976
Highly Cited
1976
Gas phase chemical kinetics of sodium in the upper atmosphere
C. Kolb
,
J. Elgin
Nature
1976
Corpus ID: 4153547
THE existence of a layer of atomic sodium in the upper atmosphere near 90 km has been clearly demonstrated by analyses of daytime…
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