Sciweavers

223 search results - page 9 / 45
» Generalized Descriptor Compression for Storage and Matching
Sort
View
74
Voted
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
15 years 10 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson
WWW
2008
ACM
15 years 10 months ago
Circular context-based semantic matching to identify web service composition
This paper provides initial analysis in identifying possible Web services composition using context-based semantic matching. Context-based semantic matching allows service composi...
Aviv Segev
SIGMOD
2009
ACM
218views Database» more  SIGMOD 2009»
15 years 9 months ago
DejaVu: declarative pattern matching over live and archived streams of events
DejaVu is an event processing system that integrates declarative pattern matching over live and archived streams of events on top of a novel system architecture. We propose to dem...
Nihal Dindar, Baris Güç, Patrick Lau, ...
CIKM
2005
Springer
15 years 3 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
SIGIR
2010
ACM
14 years 4 months ago
Efficient partial-duplicate detection based on sequence matching
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
Qi Zhang, Yue Zhang, Haomin Yu, Xuanjing Huang