Sciweavers

3018 search results - page 303 / 604
» Replicating for Performance: Case Studies
Sort
View
CORR
2012
Springer
281views Education» more  CORR 2012»
14 years 2 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
PPOPP
2012
ACM
14 years 2 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ICDE
2012
IEEE
249views Database» more  ICDE 2012»
13 years 9 months ago
Answering Why-not Questions on Top-k Queries
Abstract—After decades of effort working on database performance, the quality and the usability of database systems have received more attention in recent years. In particular, t...
Zhian He, Eric Lo
FGCN
2008
IEEE
116views Communications» more  FGCN 2008»
16 years 1 months ago
Routing in Degree-Constrained FSO Mesh Networks
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
Ziping Hu, Pramode K. Verma, James J. Sluss Jr.
ICC
2007
IEEE
16 years 1 months ago
Channel Estimation Considerations for Iterative Decoding in Wireless Communications
—The time-varying nature of wireless channels poses a challenge for using soft-decision iterative decoders on such channels. Even if the channel gain is perfectly known to the re...
Pirouz Zarrinkhat, Masoud Ardakani, Raman Yazdani