Sciweavers

3640 search results - page 564 / 728
» The Geometry of Web Search
Sort
View
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
16 years 1 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
16 years 17 days ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
FOCS
2006
IEEE
16 years 16 days ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
IROS
2006
IEEE
125views Robotics» more  IROS 2006»
16 years 15 days ago
Surface Recognition by Registering Data Curves from Touch
Model-based recognition of an object typically involves matching dense 3D range data. The computational cost is directly affected by the amount of data of which a transformation n...
Rinat Ibrayev, Yan-Bin Jia
COMPGEOM
2006
ACM
16 years 14 days 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