Sciweavers

316 search results - page 47 / 64
» Network Generalized Hamming Weight
Sort
View
IJON
2006
109views more  IJON 2006»
14 years 9 months ago
Integrating the improved CBP model with kernel SOM
In this paper, we first design a more generalized network model, Improved CBP, based on the same structure as Circular BackPropagation (CBP) proposed by Ridella et al. The novelty ...
Qun Dai, Songcan Chen
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
14 years 10 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
INFOCOM
2003
IEEE
15 years 2 months ago
Can Shortest-path Routing and TCP Maximize Utility
TCP-AQM protocols can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCP–...
Jiantao Wang, Lun Li, Steven H. Low, John Doyle
SIROCCO
2007
14 years 11 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
ICANN
2010
Springer
14 years 8 months ago
Autonomous Generation of Internal Representations for Associative Learning
In this contribution, we explore the possibilities of learning in large-scale, multimodal processing systems operating under real-world conditions. Using an instance of a large-sca...
Michaël Garcia Ortiz, Benjamin Dittes, Jannik...