12825 search results - page 371 / 2565 » Improved PLSOM algorithm |
236
click to vote
ISCAPDCS
2003
15 years 8 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
208
click to vote
TSP
2008
15 years 7 months ago
2008
We present a discriminative training algorithm, that uses support vector machines (SVMs), to improve the classification of discrete and continuous output probability hidden Markov ...
211
click to vote
AAIM
2009
Springer
16 years 2 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
192
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
197
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...