Sciweavers

1855 search results - page 26 / 371
» A coding theorem for distributed computation
Sort
View
FOCS
1997
IEEE
14 years 3 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek
IDMS
1998
Springer
141views Multimedia» more  IDMS 1998»
14 years 3 months ago
An Image Coding and Reconstruction Scheme for Mobile Computing
An asynchronous transfer mode (ATM) wireless network has bursty and high error rates. To combat the contiguous bit loss due to damaged or dropped packets, this paper presents a cod...
Edward Y. Chang
IPPS
2000
IEEE
14 years 3 months ago
An Open Market-Based Architecture for Distributed Computing
One of the challenges in large scale distributed computing is to utilize the thousands of idle personal computers. In this paper, we present a system that enables users to e ortles...
Spyros Lalis, Alexandros Karypidis
IPPS
2005
IEEE
14 years 4 months ago
P2PDisCo - Java Distributed Computing for Workstations Using Chedar Peer-to-Peer Middleware
This paper introduces Peer-to-Peer Distributed Computing (P2PDisCo) software, which provides an interface for distributing the computation of Java programs to multiple workstation...
Niko Kotilainen, Mikko Vapa, Matthieu Weber, Joni ...
IPPS
2002
IEEE
14 years 3 months ago
Real-Time Communication for Distributed Vision Processing Based on Imprecise Computation Model
In this paper we propose an efficient real-time communication mechanism for distributed vision processing. One of the biggest problems of distributed vision processing, as is the ...
Hiromasa Yoshimoto, Daisaku Arita, Rin-ichiro Tani...