Sciweavers

1480 search results - page 178 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
ICDCS
2010
IEEE
15 years 4 months ago
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
Chen Chen, Hans-Arno Jacobsen, Roman Vitenberg
114
Voted
JSAC
2011
116views more  JSAC 2011»
14 years 7 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
120
Voted
FTTCS
2006
132views more  FTTCS 2006»
15 years 22 days ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
81
Voted
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 5 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
113
Voted
PPOPP
2012
ACM
13 years 8 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...