Most programs are repetitive, meaning that some parts of a program are executed more than once. As a result, a number of phases can be extracted in which each phase exhibits simila...
Frederik Vandeputte, Lieven Eeckhout, Koen De Boss...
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
— We present the ASKALON environment whose goal is to simplify the development and execution of workflow applications on the Grid. ASKALON is centered around a set of high-level...
Thomas Fahringer, Radu Prodan, Rubing Duan, France...
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user the transparency of anywhere, anyplace, anytime computing. Pervasive compu...
K. Kalapriya, S. K. Nandy, Deepti Srinivasan, R. U...