126 search results - page 18 / 26 » A Framework for Efficient Minimum Distance Computations |
PAMI
2006
13 years 8 months ago
2006
For shapes represented as closed planar contours, we introduce a class of functionals which are invariant with respect to the Euclidean group and which are obtained by performing i...
MOBIHOC
2010
ACM
13 years 6 months ago
2010
ACM
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
IEEEPACT
2002
IEEE
14 years 1 months ago
2002
IEEE
Java exception checks are designed to ensure that any faulting instruction causing a hardware exception does not terminate the program abnormally. These checks, however, impose so...