400 search results - page 23 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
116
click to vote
UAI
2003
15 years 1 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
EUROPAR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
PLDI
2010
ACM
15 years 5 months ago
2010
ACM
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
189
click to vote
ICDT
2009
ACM
16 years 16 days ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
106
click to vote
DAC
1996
ACM
15 years 4 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...