Sciweavers

79 search results - page 5 / 16
» Applications of Quick-Combine for Ranked Query Models
Sort
View
ICTIR
2009
Springer
13 years 5 months ago
An Effective Approach to Verbose Queries Using a Limited Dependencies Language Model
Intuitively, any `bag of words' approach in IR should benefit from taking term dependencies into account. Unfortunately, for years the results of exploiting such dependencies ...
Eduard Hoenkamp, Peter Bruza, Dawei Song, Qiang Hu...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGIR
2010
ACM
13 years 11 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
SSD
2007
Springer
124views Database» more  SSD 2007»
14 years 1 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
MM
1997
ACM
133views Multimedia» more  MM 1997»
13 years 11 months ago
Supporting Similarity Queries in MARS
To address the emerging needs of applications that require access to and retrieval of multimediaobjects, we are developing the Multimedia Analysis and Retrieval System (MARS) in o...
Michael Ortega, Yong Rui, Kaushik Chakrabarti, Sha...