16257 search results - page 352 / 3252 » D-finiteness: algorithms and applications |
203
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—The parameterless self-organizing map (PLSOM) is a new neural network algorithm based on the self-organizing map (SOM). It eliminates the need for a learning rate and annealing ...
169
Voted
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
122
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
A large number of methods for circle detection has been studied in the last years for numerous image processing applications. The application domain considered in this paper is th...
183
click to vote
VLSID
2006
IEEE
16 years 24 days ago
2006
IEEE
Low density parity check (LDPC) codes are one of the most powerful error correcting codes known. Recent research have pointed out their potential for a low cost, low latency hardw...
157
click to vote
CCGRID
2004
IEEE
15 years 10 months ago
2004
IEEE
1 Scheduling resources on Grids is a well-known problem. The extension of Grids to LambdaGrids requires scheduling of lambdas, i.e., end-to-end high-speed circuits. In this paper, ...