5153 search results - page 257 / 1031 » Introduction to Randomized Algorithms |
115
Voted
ICIP
1995
IEEE
16 years 5 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...
134
Voted
WAW
2007
Springer
15 years 9 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...
165
Voted
DFG
1992
Springer
15 years 7 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...
125
Voted
SPAA
1992
ACM
15 years 7 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...
105
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...