5115 search results - page 65 / 1023 » On Randomized Lanczos Algorithms |
IDEAS
2007
IEEE
15 years 6 months ago
2007
IEEE
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
143
click to vote
FSE
2007
Springer
15 years 6 months ago
2007
Springer
Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing rando...
COMBINATORICS
2006
14 years 12 months ago
2006
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
103
click to vote
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...