Sciweavers

342 search results - page 53 / 69
» Branch-and-bound processing of ranked queries
Sort
View
SIGIR
2008
ACM
13 years 9 months ago
A study of learning a merge model for multilingual information retrieval
This paper proposes a learning approach for the merging process in multilingual information retrieval (MLIR). To conduct the learning approach, we also present a large number of f...
Ming-Feng Tsai, Yu-Ting Wang, Hsin-Hsi Chen
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 10 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
ECIR
2010
Springer
13 years 10 months ago
Analyzing Information Retrieval Methods to Recover Broken Web Links
In this work we compare different techniques to automatically find candidate web pages to substitute broken links. We extract information from the anchor text, the content of the p...
Juan Martinez-Romo, Lourdes Araujo
WWW
2008
ACM
14 years 10 months ago
Recommending questions using the mdl-based tree cut model
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
Yunbo Cao, Huizhong Duan, Chin-Yew Lin, Yong Yu, H...
WWW
2002
ACM
14 years 10 months ago
Probabilistic question answering on the web
Web-based search engines such as Google and NorthernLight return documents that are relevant to a user query, not answers to user questions. We have developed an architecture that...
Dragomir R. Radev, Weiguo Fan, Hong Qi, Harris Wu,...