Sciweavers

4998 search results - page 894 / 1000
» The case for intentional networking
Sort
View
CN
2007
77views more  CN 2007»
13 years 8 months ago
Secure many-to-one symbol transmission for implementation on smart cards
Multicast communication is arguably the most promising paradigm to enable mass Internet transmission of live events, or any other content sent on the network from a single source ...
Francesc Sebé, Alexandre Viejo, Josep Domin...
IJHPCA
2006
109views more  IJHPCA 2006»
13 years 8 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
JACM
2008
90views more  JACM 2008»
13 years 8 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
COR
2007
108views more  COR 2007»
13 years 8 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel