Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Abstract: In this paper, we study concatenated coding for MIMOOFDM systems. The proposed concatenated system achieves full spatial and frequency diversity at much lower complexity ...
Samir Al-Ghadhban, R. Michael Buehrer, Brian D. Wo...
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...