110 search results - page 2 / 22 » Patterson-Wiedemann construction revisited |
PPOPP
2011
ACM
12 years 9 months ago
2011
ACM
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
TCC
2012
Springer
12 years 1 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
GEM
2010
13 years 4 months ago
2010
In this work, we present a genetic algorithm framework for the FPGA placement problem. This framework is constructed based on previous proposals in this domain. We implement this f...
TIT
2010
13 years 1 months ago
2010
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...