Sciweavers

7289 search results - page 1185 / 1458
» A Dependent Set Theory
Sort
View
CN
2008
126views more  CN 2008»
15 years 6 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani
CN
2008
108views more  CN 2008»
15 years 6 months ago
Finding a dense-core in Jellyfish graphs
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool
173
Voted
COMCOM
2008
95views more  COMCOM 2008»
15 years 6 months ago
CHESS: An application-aware space for enhanced scalable services in overlay networks
Abstract-- We introduce in this paper CHESS, an applicationaware space for enhanced scalable services in overlay networks. In this new space, the proximity of peers is determined a...
Mohammad Malli, Chadi Barakat, Walid Dabbous
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 6 months ago
Products of Weighted Logic Programs
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
Shay B. Cohen, Robert J. Simmons, Noah A. Smith
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
Probing Capacity
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DM...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
« Prev « First page 1185 / 1458 Last » Next »