Sciweavers

1095 search results - page 149 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
133
Voted
PODC
2006
ACM
15 years 8 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
147
Voted
SPAA
2009
ACM
16 years 3 months ago
A lightweight in-place implementation for software thread-level speculation
Thread-level speculation (TLS) is a technique that allows parts of a sequential program to be executed in parallel. TLS ensures the parallel program's behaviour remains true ...
Cosmin E. Oancea, Alan Mycroft, Tim Harris
IPPS
2009
IEEE
15 years 9 months ago
BarterCast: A practical approach to prevent lazy freeriding in P2P networks
A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merel...
Michel Meulpolder, Johan A. Pouwelse, Dick H. J. E...
ICDCS
2008
IEEE
15 years 9 months ago
Online Optimization for Latency Assignment in Distributed Real-Time Systems
As distributed real-time applications gain in popularity, a key challenge is to allocate resources so that diverse realtime requirements (including non-real-time applications), di...
Cristian Lumezanu, Sumeer Bhola, Mark Astley
134
Voted
ICPADS
2010
IEEE
15 years 15 days ago
Bandwidth- and Latency-Aware Peer-to-Peer Instant Friendcast for Online Social Networks
Online Social Networks (OSNs) are more and more popular recently; people may through them interact with each other for the purpose of social intercourse. The client/server OSN arch...
Jehn-Ruey Jiang, Chao-Wei Hung, Jih-Wei Wu