Sciweavers

1096 search results - page 99 / 220
» Evaluating Algorithms for Concept Description
Sort
View
WWW
2007
ACM
14 years 9 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
CIKM
2006
Springer
13 years 10 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
CIVR
2008
Springer
220views Image Analysis» more  CIVR 2008»
13 years 10 months ago
Web-based information content and its application to concept-based video retrieval
Semantic similarity between words or phrases is frequently used to find matching correlations between search queries and documents when straightforward matching of terms fails. Th...
Alexander Haubold, Apostol Natsev
CLEF
2009
Springer
13 years 10 months ago
Prior Art Search Using International Patent Classification Codes and All-Claims-Queries
In this study, we describe our system at the Intellectual Property track of the 2009 CrossLanguage Evaluation Forum campaign (CLEF-IP). The CLEF-IP track addressed prior art searc...
Benjamin Herbert, György Szarvas, Iryna Gurev...
CIKM
2009
Springer
14 years 3 months ago
Context sensitive synonym discovery for web search queries
We propose a simple yet eective approach to context sensitive synonym discovery for Web search queries based on co-click analysis; i.e., analyzing queries leading to clicking sam...
Xing Wei, Fuchun Peng, Huihsin Tseng, Yumao Lu, Be...