Results 141 to 150 of about 24,140,242 (202)
Some of the next articles are maybe not open access.
Constant-Time Query Processing
2008 IEEE 24th International Conference on Data Engineering, 2008Query performance in current systems depends significantly on tuning: how well the query matches the available indexes, materialized views etc. Even in a well tuned system, there are always some queries that take much longer than others. This frustrates users who increasingly want consistent response times to ad hoc queries.
Vijayshankar Raman +7 more
openaire +1 more source
ACM Transactions on Database Systems, 1992
The maintenance problem of a database scheme is the following decision problem: Given a consistent database state ρ and a new tuple u over some relation scheme of ρ, is the modified state ρ ∪ { u } still consistent?
Ke Wang, Marc H. Graham
openaire +1 more source
The maintenance problem of a database scheme is the following decision problem: Given a consistent database state ρ and a new tuple u over some relation scheme of ρ, is the modified state ρ ∪ { u } still consistent?
Ke Wang, Marc H. Graham
openaire +1 more source
Graph Transformation in Constant Time
2006We present conditions under which graph transformation rules can be applied in time independent of the size of the input graph: graphs must contain a unique root label, nodes in the left-hand sides of rules must be reachable from the root, and nodes must have a bounded outdegree.
Mike Dodds, Detlef Plump
openaire +1 more source
Generating Multiset Permutations in Constant Time
Journal of Algorithms, 1997Summary: An algorithm is presented that generates multiset permutations taking constant time between each permutation.
James F. Korsh, Seymour Lipschutz
openaire +2 more sources
Constant-Time Local Computation Algorithms
Theory of Computing Systems, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mansour, Yishay +2 more
openaire +3 more sources
Constant Time Generation of Rooted Trees
SIAM Journal on Computing, 1980This paper generalizes a result of Ruskey [SIAM J. Comput., 7(1978), pp. 424–439] for generating k-ary trees lexicographically to generating all rooted trees with n vertices. An algorithm is presented which generates canonical representations of these trees in a well-defined order. As in other works, the average number of steps per tree is constant.
Terry Beyer, Sandra Mitchell Hedetniemi
openaire +1 more source
IEEE transactions on intelligent transportation systems (Print), 2018
This paper deals with the adaptive control and identification of 1-D platoon of non-identical vehicles. Three common different topologies, such as predecessor following, bi-directional leader following, and two predecessors following are considered as ...
H. Chehardoli, A. Ghasemi
semanticscholar +1 more source
This paper deals with the adaptive control and identification of 1-D platoon of non-identical vehicles. Three common different topologies, such as predecessor following, bi-directional leader following, and two predecessors following are considered as ...
H. Chehardoli, A. Ghasemi
semanticscholar +1 more source
A CONSTANT TIME ALGORITHM FOR DNA ADD
International Journal of Foundations of Computer Science, 2009We present a new molecular algorithm for adding two binary numbers with n bits. Without considering the generation of input, this algorithm can be performed in O(1) in a test tube using O(n) different types of DNA strands, and the output can be detected in O ( n ).
Haydeh Ahrabian +2 more
openaire +2 more sources
Constant time sorting on reconfigurable meshes
IEEE Transactions on Computers, 1994Summary: In this brief contribution, we present a constant time sorting algorithm by adopting a 3-D reconfigurable mesh with only \(O (n^{3/2})\) processors. Our algorithm is developed on an \(n^{1/2} \times n^{1/2} \times n^{1/2}\) 3-D reconfigurable mesh. Moreover, we further extend the result to \(k\)-dimensional reconfigurable meshes for \(k \geq 3\
Yen-Cheng Chen, Wen-Tsuen Chen
openaire +1 more source
Constant-Time Calculation of Zernike Moments for Detection with Rotational Invariance
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2019We construct a set of special complex-valued integral images and an algorithm that allows to calculate Zernike moments fast, namely in constant time. The technique is suitable for dense detection procedures, where the image is scanned by a sliding window
A. Bera, P. Klęsk, Dariusz Sychel
semanticscholar +1 more source