12015 search results - page 343 / 2403 » Interactive Algorithms 2005 |
120
click to vote
IBPRIA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neigh...
120
click to vote
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential f...
130
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
151
Voted
IJON
2006
15 years 3 months ago
2006
In this letter, a two-step learning scheme for the optimal selection of time lags is proposed for a typical temporal blind source separation (TBSS), Temporal Decorrelation source ...
141
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...