5115 search results - page 308 / 1023 » On Randomized Lanczos Algorithms |
189
click to vote
WEA
2005
Springer
16 years 22 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
266
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
194
click to vote
ICSEA
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...
210
click to vote
EC
2006
15 years 7 months ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
224
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Given a set of algorithms, which one(s) should you apply to, i) compute optical flow, or ii) perform feature matching? Would looking at the sequence in question help you decide? I...