Sciweavers

1855 search results - page 140 / 371
» A coding theorem for distributed computation
Sort
View
164
Voted
SIGSOFT
2006
ACM
15 years 9 months ago
Memories of bug fixes
The change history of a software project contains a rich collection of code changes that record previous development experience. Changes that fix bugs are especially interesting, ...
Sunghun Kim, Kai Pan, E. James Whitehead Jr.
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
15 years 3 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek
148
Voted
IPPS
2005
IEEE
15 years 9 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
IEEEPACT
2007
IEEE
15 years 9 months ago
Fast Track: Supporting Unsafe Optimizations with Software Speculation
The use of multi-core, multi-processor machines is opening new opportunities for software speculation, where program code is speculatively executed to improve performance at the a...
Kirk Kelsey, Chengliang Zhang, Chen Ding
CORR
2006
Springer
107views Education» more  CORR 2006»
15 years 3 months ago
The Multiple Access Channel with Feedback and Correlated Sources
Abstract-- In this paper, we investigate communication strategies for the multiple access channel with feedback and correlated sources (MACFCS). The MACFCS models a wireless sensor...
Lawrence Ong, Mehul Motani