Sciweavers

13214 search results - page 2313 / 2643
» Pseudorandomness for network algorithms
Sort
View
CN
2006
91views more  CN 2006»
15 years 6 months ago
End-host controlled multicast routing
The last decade has seen a deluge of proposals for supporting multicast in the Internet. These proposals can be categorized as either infrastructure-based, with the multicast func...
Karthik Lakshminarayanan, Ananth Rao, Ion Stoica, ...
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 6 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
DAM
2006
132views more  DAM 2006»
15 years 6 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
CN
2007
135views more  CN 2007»
15 years 6 months ago
Handling feature interactions in the language for end system services
Since traditional telecommunication networks assume dumb terminals, there are rarely feature interactions involving end systems. However, in Internet telephony systems, such featur...
Xiaotao Wu, Henning Schulzrinne
157
Voted
COR
2007
88views more  COR 2007»
15 years 6 months ago
Finding minimum and equitable risk routes for hazmat shipments
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...
Pasquale Carotenuto, Stefano Giordani, Salvatore R...
« Prev « First page 2313 / 2643 Last » Next »