Sciweavers

565 search results - page 76 / 113
» Geometry of Upper Probabilities
Sort
View
COMPGEOM
2010
ACM
15 years 5 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
COMPGEOM
2007
ACM
15 years 3 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
ICCV
2001
IEEE
16 years 1 months ago
Joint Feature Distributions for Image Correspondence
We introduce `Joint Feature Distributions', a general statistical framework for feature based multi-image matching that explicitly models the joint probability distributions ...
Bill Triggs
COMPGEOM
2006
ACM
15 years 5 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
ISRR
2005
Springer
99views Robotics» more  ISRR 2005»
15 years 5 months ago
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Why is probabilistic roadmap (PRM) planning probabilistic? How does the probability measure used for sampling a robot’s configuration space affect the performance of a PRM plan...
David Hsu, Jean-Claude Latombe, Hanna Kurniawati