Sciweavers

342 search results - page 5 / 69
» Combinatorial Framework for Similarity Search
Sort
View
COLING
2000
13 years 9 months ago
Informed Parsing for Coordination with Combinatory Categorial Grammar
Coordination in natural language hamlmrs ef tieient parsing, especially due to the multiple and mostly unintended candidate conjuncts/disjmmts in a given sentence that shows struc...
Jong C. Park, Hyung Joon Cho
WEBI
2010
Springer
13 years 5 months ago
Hierarchical Cost-Sensitive Web Resource Acquisition for Record Matching
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
Yee Fan Tan, Min-Yen Kan
PAMI
2006
146views more  PAMI 2006»
13 years 7 months ago
Attention-Based Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Bounds
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
Tamar Avraham, Michael Lindenbaum
ECCV
2004
Springer
14 years 9 months ago
Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
Tamar Avraham, Michael Lindenbaum
WEBI
2009
Springer
14 years 2 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova