Sciweavers

1273 search results - page 161 / 255
» Recovery from
Sort
View
SIROCCO
2003
13 years 9 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
INTERACT
1997
13 years 9 months ago
Making menus musical
Future human-computer interfaces will use more than just graphical output to display information. In this paper we suggest that sound and graphics together can be used to improve i...
Stephen A. Brewster, Murray Crease
DCC
2008
IEEE
13 years 8 months ago
A Reliable Chunkless Peer-to-Peer Architecture for Multimedia Streaming
In this paper we propose a chunkless structure for multimedia distribution over peer-to-peer networks. With the proposed approach, the original multimedia packets are partitioned ...
Riccardo Bernardini, Roberto Rinaldo, Andrea Vital...
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 8 months ago
Intermediate Performance of Rateless Codes
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...
Sujay Sanghavi
JCSS
2008
96views more  JCSS 2008»
13 years 8 months ago
Stateless data concealment for distributed systems
With the growing number of Web applications and their variety, the need to prevent unauthorised access to data and to ensure data integrity in distributed systems has led to an in...
Rachid Anane, Sukhvir Dhillon, Behzad Bordbar