Sciweavers

197 search results - page 5 / 40
» Robust Parallel Computations through Randomization
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
PODC
2005
ACM
15 years 3 months ago
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
Kamal Jain, László Lovász, Ph...
INFOCOM
2010
IEEE
14 years 8 months ago
Compressive Oversampling for Robust Data Transmission in Sensor Networks
—Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensin...
Zainul Charbiwala, Supriyo Chakraborty, Sadaf Zahe...
IEICET
2006
68views more  IEICET 2006»
14 years 9 months ago
A Reliable and Robust Lane Detection System Based on the Parallel Use of Three Algorithms for Driving Safety Assistance
Road traffic incidents analysis has shown that a third of them occurs without any conflict which indicates problems with road following. In this paper a driving safety assistance ...
Raphaël Labayrade, Jerome Douret, Jean Laneur...
HPDC
2000
IEEE
15 years 2 months ago
Resource Management through Multilateral Matchmaking
Federated distributed systems present new challenges to resource management, which cannot be met by conventional systems that employ relatively static resource models and centrali...
Rajesh Raman, Miron Livny, Marvin H. Solomon