12825 search results - page 376 / 2565 » Improved PLSOM algorithm |
185
click to vote
SWAT
2004
Springer
16 years 23 days ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
307
click to vote
VLSISP
2011
15 years 2 months ago
2011
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
225
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
190
click to vote
INFOCOM
2005
IEEE
16 years 1 months ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
154
click to vote
GECCO
2004
Springer
16 years 24 days ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...