Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,090,216 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.
2013
2013
Asymptotic Analysis of Switched Uniform Polar Quantization for Memoryless Gaussian Source
Z. Perić
,
Jelena R. Nikolić
IEEE Signal Processing Letters
2013
Corpus ID: 12510124
This letter performs an asymptotic analysis of the switched uniform polar quantizer (SUPQ) composed of k asymptotically optimal…
Expand
2008
2008
Decentralized detection in resource-limited sensor network architectures
Wee Peng Tay
2008
Corpus ID: 31616034
We consider the problem of decentralized binary detection in a network consisting of a large number of nodes arranged as a tree…
Expand
2005
2005
Distributed Detection in Large-Scale Sensor Networks with Correlated Sensor Observations
Wen-Jun Li
,
Huai-Yu Dai
2005
Corpus ID: 15444427
Detection of a deterministic signal in correlated Gaussian noise in large-scale sensor networks is considered. In contrast to…
Expand
2003
2003
Correlated MIMO Rayleigh Fading Channels: Capacity, Optimal Signaling, and Asymptotics 1
V. Veeravalli
,
Y. 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
2002
2002
Control of Polling in Presence of Vacations in Heavy Traffic with Applications to Satellite and Mobile Radio Systems
E. Altman
,
H. Kushner
SIAM Journal of Control and Optimization
2002
Corpus ID: 9659812
Consider a queueing system with many queues, each with its own input stream, but with only one server. The server must allocate…
Expand
1996
1996
Asymptotically optimal interface solvers for the biharmonic Dirichlet problem on convex polygonal domains
B. Khoromskij
,
G. Schmidt
1996
Corpus ID: 125441479
In this paper we consider an efficient discretization scheme for the boundary reduction of the biharmonic Dirichlet problem on…
Expand
1985
1985
Capabilitiy of array processing algorithms to estimate source bearings
S. D. De Graaf
,
Don H. Johnson
IEEE Transactions on Acoustics Speech and Signal…
1985
Corpus ID: 10851060
The capabilities of classical, minimum energy, and linear predictive array processing algorithms to estimate the bearings of two…
Expand
1983
1983
Low Complexity Decoders for Constant Envelope Digital Modulations
S. Simmons
,
P. Wittke
IEEE Transactions on Communications
1983
Corpus ID: 62628258
Digital angle modulations having input symbol memory can be demodulated using maximum likelihood sequence estimation (MLSE or…
Expand
1970
1970
Systematic construction of self-orthogonal diffuse codes
Shih-Yung Tong
IEEE Transactions on Information Theory
1970
Corpus ID: 12973161
A systematic procedure for constructing binary self-orthogonal diffuse codes is presented. These codes correct both random and…
Expand
1965
1965
On adaptive nonparametric detection systems using dependent samples
M. Kanefsky
,
J. Thomas
IEEE Transactions on Information Theory
1965
Corpus ID: 5506338
A procedure is obtained for modifying given sampled-data parametric detectors to make them asymptotically nonparametric. Unlike…
Expand