400 search results - page 72 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
98
Voted
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
87
Voted
SPAA
2010
ACM
14 years 9 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
109
click to vote
EDBT
1998
ACM
15 years 1 months ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
RTS
2010
14 years 7 months ago
2010
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) ...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...