Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,568,974 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.
2018
2018
On-Supporting Energy Balanced $k$ -Barrier Coverage in Wireless Sensor Networks
Chien-I Weng
,
Chih-Yung Chang
,
Chih-Yao Hsiao
,
Chao-Tsun Chang
,
Haibao Chen
IEEE Access
2018
Corpus ID: 4566223
Barrier coverage in the area of wireless sensor networks (WSNs) has received much attention in the past few years. To guarantee…
Expand
2014
2014
Distance-based High-frequency Trading
Travis Felker
,
V. Mazalov
,
S. Watt
International Conference on Conceptual Structures
2014
Corpus ID: 17185512
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
Optimal placement of FSO relays for network disaster recovery
F. Ahdi
,
S. Subramaniam
IEEE International Conference on Communications…
2013
Corpus ID: 33314282
Free Space Optics (FSO) relays can be used to recover a network which is partially disconnected due to natural disasters or…
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
2009
2009
On the Complexity of Reliable Root Approximation
Michael Kerber
Computer Algebra in Scientific Computing
2009
Corpus ID: 18084595
This work addresses the problem of computing a certified *** -approximation of all real roots of a square-free integer polynomial…
Expand
2005
2005
A Hybrid Approach to Query and Document Translation Using a Pivot Language for Cross-Language Information Retrieval
Kazuaki Kishida
,
N. Kando
Conference and Labs of the Evaluation Forum
2005
Corpus ID: 8496236
This paper reports experimental results for cross-language infor-mation retrieval (CLIR) from German to French, in which a hybrid…
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
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
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