71228 search results - page 412 / 14246 » Algorithms |
156
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
203
click to vote
ICA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In this paper, a new algorithm for source recovery in underdetermined Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented i...
199
click to vote
ICANN
2007
Springer
16 years 1 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
138
click to vote
ISAAC
2007
Springer
16 years 1 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...
188
click to vote
ISNN
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...