Sciweavers

13 search results - page 2 / 3
» Improving bipartite graphs using multi-strategy simulated an...
Sort
View
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
13 years 10 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
FPL
2005
Springer
127views Hardware» more  FPL 2005»
13 years 11 months ago
Fast FPGA Placement using Space-filling Curve
In this paper, we propose a placement method for islandstyle FPGAs, based on recursive bi-partitioning followed by application of space-filling curves. Experimental results of ou...
Pritha Banerjee, Subhasis Bhattacharjee, Susmita S...
SOCIALCOM
2010
13 years 4 months ago
On the Navigability of Social Tagging Systems
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
Denis Helic, Christoph Trattner, Markus Strohmaier...
ASPLOS
2006
ACM
14 years 6 days ago
A spatial path scheduling algorithm for EDGE architectures
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
Katherine E. Coons, Xia Chen, Doug Burger, Kathryn...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 6 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