Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
With macro and micro base stations (BSs) of different transmission and processing capabilities jointly deployed, heterogeneous… 
Highly Cited
2008
Highly Cited
2008
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear… 
Highly Cited
2008
Highly Cited
2008
Optimal power allocation for distributed parameter estimation in a wireless sensor network with a fusion center under a total… 
2008
2008
Achieving the sum-capacity of a multiple-input-multiple- output (MIMO) Gaussian broadcast channel is known to require full… 
2006
2006
The second-order blind identification (SOBI) algorithm for separation of stationary sources was proved to be useful in many… 
2003
2003
The capacity of the MIMO channel is investigated under the assumption that the elements of the channel matrix are zero mean… 
Highly Cited
1997
Highly Cited
1997
This letter develops an optimal, nonlinear estimator of a deterministic signal in noise. The methods of penalized least-squares… 
Highly Cited
1993
Highly Cited
1993
We propose an asymptotically optimal multiversion B-tree. In our setting, insertions and deletions of data items are allowed only… 
1983
1983
Digital angle modulations having input symbol memory can be demodulated using maximum likelihood sequence estimation (MLSE or…