Sciweavers

4744 search results - page 47 / 949
» Connected Computing
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
Tomás Feder, Adam Guetz, Milena Mihail, Ami...
IPPS
1998
IEEE
14 years 23 days ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
IPPS
1998
IEEE
14 years 23 days ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
SCCC
1997
IEEE
14 years 21 days ago
Video Server on an ATM Connected Cluster of Workstations
Video servers are important for applicationswhich make use of digital video. The video servers should provide better functionality than most of today’s video servers offer, – ...
Olav Sandstå, Stein Langørgen, Roger ...
CLUSTER
2000
IEEE
14 years 3 days ago
Efficient Parallel I/O on SCI Connected Clusters
This paper presents a new approach towards parallel I/O for message-passing (MPI) applications on clusters built with commodity hardware and an SCI interconnect: instead of using t...
Joachim Worringen