Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,113,991 papers from all fields of science
Search
Sign In
Create Free Account
Context of computational complexity
Known as:
Bit complexity
, Complexity of computation (bit)
In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
Abstract machine
Analysis of algorithms
Binary search algorithm
Cache-oblivious algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
ANALYSIS OF IMAGE COMPRESSION ALGORITHMS USING WAVELET TRANSFORM WITH GUI IN MATLAB
Y. Sukanya
,
J. Preethi
2013
Corpus ID: 1441528
Image compression is nothing but reducing the amount of data required to represent an image. To compress an image efficiently we…
Expand
2013
2013
Combining rough set and case based reasoning for process conditions selection in camshaft grinding
X. H. Zhang
,
Z. Deng
,
Weixue Liu
,
H. Cao
Journal of Intelligent Manufacturing
2013
Corpus ID: 46023481
Case Based Reasoning (CBR) is a novel paradigm that uses previous cases to solve new, unseen and different problems. However…
Expand
2011
2011
Adaboost Ensemble with Genetic Algorithm Post Optimization for Intrusion Detection
H. Harb
,
Abeer S. Desuky
2011
Corpus ID: 16971371
This paper presents a fast learning algorithm using AdaBoost ensemble with simple genetic algorithms (GAs) for intrusion…
Expand
2008
2008
Large MIMO Systems: A Low-Complexity Detector at High Spectral Efficiencies
S. K. Mohammed
,
K. Vardhan
,
A. Chockalingam
,
B. Rajan
IEEE International Conference on Communications
2008
Corpus ID: 16074217
We consider large MIMO systems, where by 'large' we mean number of transmit and receive antennas of the order of tens to hundreds…
Expand
1997
1997
Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N log N) Bit-Complexity
T. Szymanski
IEEE Trans. Computers
1997
Corpus ID: 9356636
Principles for designing practical self-routing nonblocking N/spl times/N circuit-switched connection networks with optimal /spl…
Expand
1993
1993
The Complexity of Computation on the Parallel Random Access Machine
Faith Ellen
1993
Corpus ID: 14325291
1993
1993
A fuzzy C-means clustering placement algorithm
M. Razaz
IEEE International Symposium on Circuits and…
1993
Corpus ID: 5097475
A placement algorithm based on fuzzy c-means clustering techniques is presented. The first stage of the algorithm is to construct…
Expand
1993
1993
Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for their minimisation
L. Csanky
,
M. Perkowski
,
I. Schafer
1993
Corpus ID: 6628763
The concept of canonical restricted mixed polarity (CRMP) exclusive-OR sum of products forms is introduced. The CRMP forms…
Expand
1991
1991
A call admission control scheme in ATM networks
Y. Miyao
ICC 91 International Conference on Communications…
1991
Corpus ID: 60719529
In an ATM (asynchronous transfer mode) network, call admission control decides whether or not to accept a new call, so as to…
Expand
1987
1987
Complexity of computation of embedded resolution of algebraic curves
J. Henry
,
M. Merle
European Conference on Computer Algebra
1987
Corpus ID: 6229637
We study the complexity of an algorithm we gave in a former paper to compute an embedded resolution of an irreducible singular…
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