Sciweavers

829 search results - page 133 / 166
» Minimal document set retrieval
Sort
View
SIGIR
2006
ACM
14 years 1 months ago
Answering complex questions with random walk models
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
Sanda M. Harabagiu, V. Finley Lacatusu, Andrew Hic...
SIGIR
1999
ACM
13 years 12 months ago
Visualization of Search Results: A Comparative Evaluation of Text, 2D, and 3D Interfaces
Although there have been many prototypes of visualization in support of information retrieval, there has been little systematic evaluation that distinguishes the benefits of the v...
Marc M. Sebrechts, John Cugini, Sharon J. Laskowsk...
CIKM
2008
Springer
13 years 9 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan
SAC
2002
ACM
13 years 7 months ago
Hierarchical presentation of expansion terms
Different presentations of candidate expansion terms have not been fully explored in interactive query expansion (IQE). Most existing systems that offer an IQE facility use a list...
Hideo Joho, Claire Coverson, Mark Sanderson, Miche...
DAGSTUHL
2004
13 years 9 months ago
Requirements for and Design of a Processor with Predictable Timing
Abstract. This paper introduces a set of design principles that aim to make processor architectures amenable to static timing analysis. Based on these principles, we give a design ...
Christoph Berg, Jakob Engblom, Reinhard Wilhelm