5115 search results - page 449 / 1023 » On Randomized Lanczos Algorithms |
162
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
184
click to vote
COCO
2005
Springer
16 years 1 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
178
click to vote
SPAA
1998
ACM
15 years 12 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
204
click to vote
FSTTCS
2000
Springer
15 years 11 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
202
click to vote
ICCV
2003
IEEE
16 years 9 months ago
2003
IEEE
We propose a two-class classification model for grouping. Human segmented natural images are used as positive examples. Negative examples of grouping are constructed by randomly m...