Sciweavers

6300 search results - page 1196 / 1260
» We have it easy, but do we have it right
Sort
View
PODC
2012
ACM
13 years 3 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
IJCV
2012
13 years 3 months ago
Harmony Potentials - Fusing Global and Local Scale for Semantic Image Segmentation
The Hierarchical Conditional Random Field (HCRF) model have been successfully applied to a number of image labeling problems, including image segmentation. However, existing HCRF m...
Xavier Boix, Josep M. Gonfaus, Joost van de Weijer...
ICDCS
2012
IEEE
13 years 3 months ago
G-COPSS: A Content Centric Communication Infrastructure for Gaming Applications
—With users increasingly focused on an online world, an emerging challenge for the network infrastructure is the need to support Massively Multiplayer Online Role Playing Games (...
Jiachen Chen, Mayutan Arumaithurai, Xiaoming Fu, K...
115
Voted
BMCBI
2008
119views more  BMCBI 2008»
15 years 26 days ago
Snagger: A user-friendly program for incorporating additional information for tagSNP selection
Background: There has been considerable effort focused on developing efficient programs for tagging single-nucleotide polymorphisms (SNPs). Many of these programs do not account f...
Christopher K. Edlund, Won H. Lee, Dalin Li, David...
119
Voted
PODC
2009
ACM
16 years 1 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
« Prev « First page 1196 / 1260 Last » Next »