Sciweavers

1095 search results - page 182 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 4 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
BMCBI
2006
239views more  BMCBI 2006»
15 years 2 months ago
Applying dynamic Bayesian networks to perturbed gene expression data
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek...
207
Voted
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
16 years 9 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...
114
Voted
FOCS
2008
IEEE
15 years 8 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Matthias Englert, Deniz Özmen, Matthias Weste...
CLUSTER
2006
IEEE
15 years 8 months ago
Stochastic Scheduling with Availability Constraints in Heterogeneous Clusters
High availability plays an important role in heterogeneous clusters, where processors operate at different speeds and are not continuously available for processing. Existing sched...
Tao Xie 0004, Xiao Qin