Sciweavers

440 search results - page 4 / 88
» Partial Matching by Structural Descriptors
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
WWW
2005
ACM
14 years 8 months ago
Web data extraction based on partial tree alignment
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
Yanhong Zhai, Bing Liu
DAM
2002
96views more  DAM 2002»
13 years 7 months ago
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
David Manlove
MM
2009
ACM
198views Multimedia» more  MM 2009»
14 years 4 days ago
Scalable detection of partial near-duplicate videos by visual-temporal consistency
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-S...
ICCV
2009
IEEE
15 years 13 days ago
A Robust Elastic and Partial Matching Metric for Face Recognition
We present a robust elastic and partial matching metric for face recognition. To handle challenges such as pose, facial expression and partial occlusion, we enable both elastic ...
Gang Hua, Amir Akbarzadeh