Sciweavers

2421 search results - page 131 / 485
» Message from the Editor-in-Chief
Sort
View
SIGCOMM
2005
ACM
14 years 3 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
NORDICHI
2004
ACM
14 years 3 months ago
Adaptivity in speech-based multilingual e-mail client
In speech interfaces users must be aware what can be done with the system – in other words, the system must provide information to help the users to know what to say. We have ad...
Esa-Pekka Salonen, Mikko Hartikainen, Markku Turun...
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
14 years 3 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
PODC
2003
ACM
14 years 3 months ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
ASIACRYPT
2001
Springer
14 years 2 months ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank