887 search results - page 130 / 178 » A Time for Choosing |
ASIACRYPT
2001
Springer
14 years 3 months ago
2001
Springer
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...
MM
1994
ACM
14 years 3 months ago
1994
ACM
In an on-demand video server environment, clients make requests for movies to a centralized video server. Due to the stringent response time requirements, continuous delivery of a...
EDBT
2006
ACM
14 years 2 months ago
2006
ACM
Abstract. In wireless data broadcast systems, popular information is repetitively disseminated through possibly multiple communication channels to mobile clients using various type...
ACL
1994
14 years 16 days ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
COMBINATORICA
2007
13 years 11 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...