Sciweavers

316 search results - page 7 / 64
» Network Generalized Hamming Weight
Sort
View
INFOCOM
1996
IEEE
15 years 1 months ago
Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
Dimitrios Stiliadis, Anujan Varma
ICASSP
2009
IEEE
15 years 4 months ago
Generalization of specialized on-the-fly composition
In the Weighted Finite State Transducer (WFST) framework for speech recognition, we can reduce memory usage and increase flexibility by using on-the-fly composition which genera...
Tasuku Oonishi, Paul R. Dixon, Koji Iwano, Sadaoki...
SIAMCOMP
2010
125views more  SIAMCOMP 2010»
14 years 4 months ago
Approximating Steiner Networks with Node-Weights
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
Zeev Nutov
NETWORK
2010
122views more  NETWORK 2010»
14 years 4 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
ECML
2007
Springer
15 years 3 months ago
Nondeterministic Discretization of Weights Improves Accuracy of Neural Networks
Abstract. The paper investigates modification of backpropagation algorithm, consisting of discretization of neural network weights after each training cycle. This modification, a...
Marcin Wojnarski