Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,383,002 papers from all fields of science
Search
Sign In
Create Free Account
Asymptotically optimal algorithm
Known as:
Asymptotic optimality
, Asymptotically faster algorithm
, Asymptotically optimal
In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Abstract machine
Ackermann function
Algorithm
Asymptotic computational complexity
Expand
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Intracell Cooperation and Resource Allocation in a Heterogeneous Network With Relays
Qian Li
,
R. Hu
,
Y. Qian
,
Geng Wu
IEEE Transactions on Vehicular Technology
2013
Corpus ID: 13646604
With macro and micro base stations (BSs) of different transmission and processing capabilities jointly deployed, heterogeneous…
Expand
2013
2013
When simplicity meets optimality: Efficient transmission power control with stochastic energy harvesting
Qingsi Wang
,
M. Liu
Proceedings IEEE INFOCOM
2013
Corpus ID: 15489558
We consider the optimal transmission power control of a single wireless node with stochastic energy harvesting and an infinite…
Expand
Highly Cited
2008
Highly Cited
2008
Sensor Selection and Power Allocation for Distributed Estimation in Sensor Networks: Beyond the Star Topology
G. Thatte
,
U. Mitra
IEEE Transactions on Signal Processing
2008
Corpus ID: 17683234
Optimal power allocation for distributed parameter estimation in a wireless sensor network with a fusion center under a total…
Expand
2008
2008
Asymptotic Analysis of Reduced-Feedback Strategies for MIMO Gaussian Broadcast Channels
Jordi Diaz
,
O. Simeone
,
Y. Bar-Ness
IEEE Transactions on Information Theory
2008
Corpus ID: 9893211
Achieving the sum-capacity of a multiple-input-multiple- output (MIMO) Gaussian broadcast channel is known to require full…
Expand
Highly Cited
2006
Highly Cited
2006
Flexible background mixture models for foreground segmentation
Jian Cheng
,
Jie Yang
,
Yue Zhou
,
Yingying Cui
Image and Vision Computing
2006
Corpus ID: 26949683
2006
2006
A computationally affordable implementation of an asymptotically optimal BSS algorithm for ar sources
P. Tichavský
,
E. Doron
,
A. Yeredor
,
Jan Nielsen
European Signal Processing Conference
2006
Corpus ID: 15103744
The second-order blind identification (SOBI) algorithm for separation of stationary sources was proved to be useful in many…
Expand
2003
2003
Correlated MIMO Rayleigh Fading Channels: Capacity, Optimal Signaling, and Asymptotics 1
V. Veeravalli
,
Yingbin Liang
,
A. Sayeed
2003
Corpus ID: 15491899
The capacity of the MIMO channel is investigated under the assumption that the elements of the channel matrix are zero mean…
Expand
Highly Cited
1997
Highly Cited
1997
Optimal signal estimation using cross-validation
R. Nowak
IEEE Signal Processing Letters
1997
Corpus ID: 1349059
This letter develops an optimal, nonlinear estimator of a deterministic signal in noise. The methods of penalized least-squares…
Expand
1993
1993
Asymptotically Optimal Loss Network Control
P. Hunt
,
C. Laws
Mathematics of Operations Research
1993
Corpus ID: 7369215
We consider a loss network which employs alternative routing and derive the asymptotically optimal call acceptance and routing…
Expand
Highly Cited
1993
Highly Cited
1993
On Optimal Multiversion Access Structures
Bruno Becker
,
S. Gschwind
,
T. Ohler
,
B. Seeger
,
P. Widmayer
International Multi-Conference on Systems…
1993
Corpus ID: 82422
We propose an asymptotically optimal multiversion B-tree. In our setting, insertions and deletions of data items are allowed only…
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