We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
Component Based Development (CBD) aims at constructing software through the integration, using interfaces and contracts, between pre-existing components. The main goal of this wor...
Robson P. de Souza, Marcelo N. Costa, Regina M. M....
The processing power and memory capacity of independent and heterogeneous parallel machines can be combined to form a single parallel system that is more powerful than any of its ...
Daniel Becker, Felix Wolf, Wolfgang Frings, Markus...
Grid applications require allocating a large number of heterogeneous tasks to distributed resources. A good allocation is critical for efficient execution. However, many existing ...
James Blythe, S. Jain, Ewa Deelman, Yolanda Gil, K...
Recently, profile context-sensitive HMMs (profile-csHMMs) have been proposed which are very effective in modeling the common patterns and motifs in related symbol sequences. Pro...