Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,833,935 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.
2016
2016
Study of Isohyets Generation Algorithm and Its Modification
Mei-Ling Yin
,
Jianxun Chen
2016
Corpus ID: 63496632
Generally speaking, isohyets need to be generated through triangulated mesh, linear interpolation, search contours. Triangulated…
Expand
2015
2015
The Quasi-Random Perspective on Matrix Spectral Analysis with Applications
M. Ben-Or
,
Lior Eldar
arXiv.org
2015
Corpus ID: 8643555
Computing the eigenvectors and eigenvalues of a given Hermitian matrix is arguably one of the most well-studied computational…
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
2011
2011
Root Refinement for Real Polynomials
Michael Kerber
,
Michael Sagraloff
arXiv.org
2011
Corpus ID: 13440223
We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm…
Expand
2009
2009
An Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm ⋆ ( Extended Abstract )
Y. Métivier
,
J. Robson
,
N. Saheb-Djahromi
,
A. Zemmari
2009
Corpus ID: 17176532
1.1 The Problem Let G = (V, E) be a simple undirected graph. A vertex colouring of G assigns colours to each vertex in such a way…
Expand
Review
2007
Review
2007
Minimum Link Path Finding Methods in 2D Polygons
W. McAveney
2007
Corpus ID: 16416429
The author surveys methods for finding a path between two arbitrary points within a 2D polygon under the link-distance metric…
Expand
2005
2005
A Hybrid Approach to Query and Document Translation Using a Pivot Language for Cross-Language Information Retrieval
Kazuaki Kishida
,
Noriko 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
2002
2002
ε-discrepancy sets and their applications for interpolation of sparse polynomials
N. Alon
2002
Corpus ID: 15607615
We present a simple explicit construction of a probability distribution supported on (p − 1) vectors in Z p , where p ≥ n/ε is a…
Expand
1994
1994
How the problem size influences the performance of an SIMD TDNN implementation
M. Vogt
,
W. Schumacher
International Conference on Neural Networks
1994
Corpus ID: 60953013
In this paper we describe the mapping and implementation of time delay neural networks (TDNN) to a grid based SIMD computer…
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