5115 search results - page 39 / 1023 » On Randomized Lanczos Algorithms |
WALCOM
2008
IEEE
15 years 1 months ago
2008
IEEE
In this paper, a fast algorithm is proposed to calculate kth power of an n
183
click to vote
VLDB
2007
ACM
16 years 4 hour ago
2007
ACM
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
138
click to vote
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
SPAA
1993
ACM
15 years 3 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.