10051 search results - page 111 / 2011 » A Dynamic Separator Algorithm |
149
Voted
EUMAS
2006
15 years 2 months ago
2006
We present a general Multi-Agent System framework for distributed data mining based on a Peer-toPeer model. The framework adopts message-based asynchronous communication and a dyn...
113
click to vote
ICA
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we propose to use the Huber M-estimator cost function as a contrast function within the complex FastICA algorithm of Bingham and Hyvarinen for the blind separation o...
61
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique com...
111
click to vote
AAECC
2008
Springer
15 years 25 days ago
2008
Springer
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...
101
Voted
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...