Sciweavers

2498 search results - page 92 / 500
» Algorithms for the Topological Watershed
Sort
View
151
Voted
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
16 years 5 days ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
168
Voted
JSAC
2007
116views more  JSAC 2007»
15 years 6 months ago
Outreach: peer-to-peer topology construction towards minimized server bandwidth costs
Abstract— On-demand and live multimedia streaming applications (such as Internet TV) are well known to utilize a significant amount of bandwidth from media streaming servers, es...
Tara Small, Baochun Li, Ben Liang
ESANN
2007
15 years 7 months ago
Tracking fast changing non-stationary distributions with a topologically adaptive neural network: application to video tracking
In this paper, an original method named GNG-T, extended from GNG-U algorithm by [1] is presented. The method performs continuously vector quantization over a distribution that chan...
Georges Adrian Drumea, Hervé Frezza-Buet
JSAC
2007
93views more  JSAC 2007»
15 years 6 months ago
Optimal Virtual Topology Design using Bus-Label Switched Paths
— Although there is a trend in reducing the number of layers in core and metropolitan area networks, still the optimal design of multi-layer networks (like IP over WDM) remains a...
Yannick Brehon, Daniel Kofman, Michal Pióro...
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
15 years 4 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam