Sciweavers

2093 search results - page 226 / 419
» Statistical Point Geometry
Sort
View
FOCS
2008
IEEE
15 years 10 months ago
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
Yefim Dinitz, Michael Elkin, Shay Solomon
ICRA
2007
IEEE
151views Robotics» more  ICRA 2007»
15 years 10 months ago
Conveying virtual tactile feedback via augmented kinesthetic stimulation
— In real object manipulation, the deformation of the fingerpads along the contact surfaces provides local information about the geometry of the object the subject is manipulati...
Alessandro Formaglio, Gabriel Baud-Bovy, Domenico ...
WADS
2007
Springer
156views Algorithms» more  WADS 2007»
15 years 10 months ago
Cuttings for Disks and Axis-Aligned Rectangles
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
Eynat Rafalin, Diane L. Souvaine, Csaba D. T&oacut...
BROADNETS
2006
IEEE
15 years 10 months ago
Snapshot: A Self-Calibration Protocol for Camera Sensor Networks
— A camera sensor network is a wireless network of cameras that are designed for ad-hoc deployment. The camera sensors in such a network need to be properly calibrated by determi...
Xiaotao Liu, Purushottam Kulkarni, Prashant J. She...
COMPGEOM
2006
ACM
15 years 10 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