We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
Abstract. We extend an information metric from intermodality (2image) registration to multimodality (multiple-image) registration so that we can simultaneously register multiple im...
Abstract — Regularized block diagonalization (RBD) is a new linear precoding technique for the multi-antenna broadcast channel and has a significantly improved sum rate and dive...
As the number of computing and storage nodes keeps increasing, the interconnection network is becoming a key element of many computing and communication systems, where the overall...