Sciweavers

4565 search results - page 644 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
CGO
2007
IEEE
15 years 9 months ago
Exploiting Narrow Accelerators with Data-Centric Subgraph Mapping
The demand for high performance has driven acyclic computation accelerators into extensive use in modern embedded and desktop architectures. Accelerators that are ideal from a sof...
Amir Hormati, Nathan Clark, Scott A. Mahlke
ISAAC
2007
Springer
70views Algorithms» more  ISAAC 2007»
15 years 9 months ago
Kinetic Maintenance of Mobile k-Centres on Trees
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
Stephane Durocher, Christophe Paul
120
Voted
IPPS
1998
IEEE
15 years 7 months ago
Multicasting and Broadcasting in Large WDM Networks
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
Weifa Liang, Hong Shen
DAC
1989
ACM
15 years 6 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
144
Voted
ICALP
2007
Springer
15 years 6 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan