1039 search results - page 34 / 208 » Query reformulation with constraints |
121
Voted
CSCLP
2005
Springer
15 years 6 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
CHI
1994
ACM
15 years 4 months ago
1994
ACM
This paper offers new principles for visual information seeking (VIS). A key concept is to support browsing, which is distinguished from familiar query composition and information...
124
Voted
DATESO
2007
15 years 2 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
97
Voted
KDD
2005
ACM
16 years 1 months ago
2005
ACM
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
95
Voted
SIGIR
2002
ACM
15 years 6 days ago
2002
ACM
This paper follows a formal approach to information retrieval based on statistical language models. By introducing some simple reformulations of the basic language modeling approa...