12825 search results - page 132 / 2565 » Improved PLSOM algorithm |
121
click to vote
ENC
2006
IEEE
15 years 11 months ago
2006
IEEE
We introduce a novel learning algorithm for noise elimination. Our algorithm is based on the re-measurement idea for the correction of erroneous observations and is able to discri...
133
click to vote
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
117
Voted
CP
2003
Springer
15 years 10 months ago
2003
Springer
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
114
click to vote
ISCC
2006
IEEE
15 years 11 months ago
2006
IEEE
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
131
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...