Sciweavers

4797 search results - page 357 / 960
» The complexity of partition tasks
Sort
View
ISPAN
1999
IEEE
15 years 11 months ago
Distributed Clustering for Ad Hoc Networks
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...
Stefano Basagni
ICALP
1999
Springer
15 years 11 months ago
Wide Area Computation
Abstract. The last decades have seen the emergence of the sea of objects paradigm for structuring complex distributed systems on workstations and local area networks. In this appro...
Luca Cardelli
RT
1999
Springer
15 years 11 months ago
Decoupling Polygon Rendering from Geometry using Rasterization Hardware
The dramatically increasing size of polygonal models resulting from 3D scanning devices and advanced modeling techniques requires new approaches to reduce the load of geometry tran...
Rüdiger Westermann, Ove Sommer, Thomas Ertl
IPPS
1997
IEEE
15 years 11 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
LCPC
1997
Springer
15 years 11 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju