Sciweavers

128 search results - page 6 / 26
» Comparing top k lists
Sort
View
WWW
2001
ACM
14 years 8 months ago
When experts agree: using non-affiliated experts to rank popular topics
In response to a query a search engine returns a ranked list of documents. If the query is on a popular topic (i.e., it matches many documents) then the returned list is usually t...
Krishna Bharat, George A. Mihaila
AI
2008
Springer
14 years 1 months ago
A Frequency Mining-Based Algorithm for Re-ranking Web Search Engine Retrievals
Abstract. Conventional web search engines retrieve too many documents for the majority of the submitted queries; therefore, they possess a good recall, since there are far more pag...
M. Barouni-Ebrahimi, Ebrahim Bagheri, Ali A. Ghorb...
CATA
2000
13 years 8 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
ECIR
2011
Springer
12 years 11 months ago
Fusion vs. Two-Stage for Multimodal Retrieval
We compare two methods for retrieval from multimodal collections. The first is a score-based fusion of results, retrieved visually and textually. The second is a two-stage method ...
Avi Arampatzis, Konstantinos Zagoris, Savvas A. Ch...
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 22 days ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...