5115 search results - page 249 / 1023 » On Randomized Lanczos Algorithms |
196
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
168
Voted
ICIP
1995
IEEE
16 years 8 months ago
1995
IEEE
A 3D super-resolution algorithm is proposed below, based on a probabilistic interpretation of the ndimensional version of Papoulis' generalized sampling theorem. The algorith...
191
click to vote
WAW
2007
Springer
16 years 1 months ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
232
click to vote
DFG
1992
Springer
15 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
178
click to vote
SPAA
1992
ACM
15 years 11 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...