We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Motivated by emerging cooperative P2P applications we study new uplink allocation algorithms for substituting the ratebased choke/unchoke algorithm of BitTorrent which was develop...
Nikolaos Laoutaris, Damiano Carra, Pietro Michiard...
Lossy compression of a discrete memoryless source (DMS) with respect to a single-letter distortion measure is considered. We study the best attainable tradeoff between the exponent...
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Intermittent failures and nondeterministic behavior complicate and compromise the effectiveness of software testing and debugging. To increase the observability of software faults,...
Raza Abbas Syed, Brian Robinson, Laurie A. William...