Sciweavers

2638 search results - page 12 / 528
» Random Geometric Complexes
Sort
View
140
Voted
COMGEO
1999
ACM
15 years 1 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
107
Voted
ICIP
2001
IEEE
16 years 3 months ago
Geometric hashing techniques for watermarking
In this paper we introduce the idea of using Computer Vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate Geometric Hashing techn...
Hagit Zabrodsky Hel-Or, Y. Yitzhaki, Yacov Hel-Or
73
Voted
CVPR
1996
IEEE
16 years 3 months ago
Randomness and Geometric Features in Computer Vision
Xavier Pennec, Nicholas Ayache
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 2 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
79
Voted
ICALP
2005
Springer
15 years 7 months ago
On the Cover Time of Random Geometric Graphs
Chen Avin, Gunes Ercal