CIKM
2010
Springer
13 years 11 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query...
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
Query recommendation has been recognized as an important mean to help users search and also improve the usability of search engines. Existing approaches mainly focus on helping us...
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
An important challenge for biomedical information retrieval (IR) is dealing with the complex, inconsistent and ambiguous biomedical terminology. Frequently, a concept-based repres...
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
We design and implement FD-Buffer, a buffer manager for database systems running on flash-based disks. Unlike magnetic disks, flash media has an inherent read-write asymmetry: w...
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
We study the problem of automatically identifying“hotspots” on the real-time web. Concretely, we propose to identify highly-dynamic ad-hoc collections of users – what we ref...
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
Web search is challenging partly due to the fact that search queries and Web documents use different language styles and vocabularies. This paper provides a quantitative analysis ...
CIKM
2010
Springer
13 years 11 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...