Sciweavers

625 search results - page 97 / 125
» Semi-preemptive routing on trees
Sort
View
DEBS
2007
ACM
13 years 10 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
HASKELL
2008
ACM
13 years 9 months ago
Clase: cursor library for a structured editor
The “zipper” is a well known design pattern for providing a cursorlike interface to a data structure. However, the classic treatise by Huet only scratches the surface of some ...
Tristan O. R. Allwood, Susan Eisenbach
ENTCS
2010
101views more  ENTCS 2010»
13 years 5 months ago
Strengthening the Zipper
The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of it...
Tristan O. R. Allwood, Susan Eisenbach
MOBIHOC
2007
ACM
14 years 8 months ago
The multicast capacity of large multihop wireless networks
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
Srinivas Shakkottai, Xin Liu, R. Srikant
INFOCOM
2008
IEEE
14 years 2 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang