Sciweavers

342 search results - page 40 / 69
» Branch-and-bound processing of ranked queries
Sort
View
NLPRS
2001
Springer
14 years 1 days ago
Japanese Information Retrieval Method Using Syntactic and Statistical Information
This paper presents a Japanese information retrieval method using the dependency relationship between words and semantic and statistical information about them. Our method gives a...
Tsunenori Mine, Hiroki Fujitani, Makoto Amamiya
SAC
2010
ACM
14 years 27 days ago
Of mice and terms: clustering algorithms on ambiguous terms in folksonomies
Developed using the principles of the Model-View-Controller architectural pattern, FolksEngine is a parametric search engine for folksonomies that allows us to test arbitrary sear...
Nicola Raffaele Di Matteo, Silvio Peroni, Fabio Ta...
CIKM
2006
Springer
13 years 9 months ago
Voting for candidates: adapting data fusion techniques for an expert search task
In an expert search task, the users' need is to identify people who have relevant expertise to a topic of interest. An expert search system predicts and ranks the expertise o...
Craig Macdonald, Iadh Ounis
EMNLP
2010
13 years 5 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
ICDE
2010
IEEE
178views Database» more  ICDE 2010»
13 years 5 months ago
The Hybrid-Layer Index: A synergic approach to answering top-k queries in arbitrary subspaces
In this paper, we propose the Hybrid-Layer Index (simply, the HL-index) that is designed to answer top-k queries efficiently when the queries are expressed on any arbitrary subset ...
Jun-Seok Heo, Junghoo Cho, Kyu-Young Whang