Sciweavers

247 search results - page 22 / 50
» Scaling up all pairs similarity search
Sort
View
ADC
2004
Springer
107views Database» more  ADC 2004»
16 years 5 days ago
Challenges in Enterprise Search
Concerted research effort since the nineteen fifties has lead to effective methods for retrieval of relevant documents from homogeneous collections of text, such as r archives,...
David Hawking
FGCS
2008
95views more  FGCS 2008»
15 years 5 months ago
SemreX: Efficient search in a semantic overlay for literature retrieval
The World Wide Web is growing at such a pace that even the biggest centralized search engines are able to index only a small part of the available documents on the Internet. The d...
Hai Jin, Hanhua Chen
PVLDB
2011
14 years 9 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
WWW
2006
ACM
16 years 7 months ago
Image annotation using search and mining technologies
In this paper, we present a novel solution to the image annotation problem which annotates images using search and data mining technologies. An accurate keyword is required to ini...
Xin-Jing Wang, Lei Zhang, Feng Jing, Wei-Ying Ma
MM
2006
ACM
180views Multimedia» more  MM 2006»
16 years 22 days ago
Fast tracking of near-duplicate keyframes in broadcast domain with transitivity propagation
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
Chong-Wah Ngo, Wanlei Zhao, Yu-Gang Jiang