Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
In this paper, we propose a new scheduling algorithm for the overlapped message passing decoding, which can be applied to general low-density parity check (LDPC) codes. The partia...
We present a time–parallel technique for the fast generation of self–similar traffic which is suitable for performance studies of Asynchronous Transfer Mode (ATM) networks. Th...
Ioanis Nikolaidis, C. Anthony Cooper, Kalyan S. Pe...
In previous work we presented an algorithm for cloning parallel simulations that enables multiple simulated execution paths to be explored simultaneously. The method is targeted f...
Detection of discourse structure is crucial in many text-based applications. This paper presents an original framework for describing textual parallelism which allows us to genera...