We revisit the issue of the complexity of database queries, in the light of the recent parametric refinement of complexity theory.
We suggest a decoding algorithm of q-ary linear codes, which we call supercode decoding.
I will describe results of recent investigations into the parallel computation of pattern recognition algorithms on a tree-structured parallel computer.
One of the basic problems in quality of service (QoS) routing is to find a path subject to multiple constraints on routing metrics.
In the probrFix problem, we are given a graph $G$, a (non-proper) vertex-coloring $c : V(G) to [r]$, and a positive integer~$k$.
The adoption of a flexible grid will benefit the network design and control plane of future optical networks by providing increased adaptability of spectral resources to heterogeneous network condi
For any code C defined over an equal energy constellation, it is first shown that at any time instance, the problem of determining codewords of C with high peak-to-average power ratios (PAPR) in a
Secondary electron emission is a critical contributor to the charge particle current balance in spacecraft charging.
This paper starts with a brief tutorial background, which reveals the origin and the significance of R(o).
The problem of model matching is a central issue for computer vision.
