Sciweavers

725 search results - page 44 / 145
» Descriptive Set Theory of Families of Small Sets
Sort
View
PPOPP
2005
ACM
15 years 3 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
LATIN
2010
Springer
15 years 4 months ago
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
JHSN
2002
68views more  JHSN 2002»
14 years 9 months ago
A theory of multi-channel schedulers for quality of service
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at...
Jorge Arturo Cobb, Miaohua Lin
TSP
2010
14 years 4 months ago
Distributed sampling of signals linked by sparse filtering: theory and applications
We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin ...
Ali Hormati, Olivier Roy, Yue M. Lu, Martin Vetter...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel