243 search results - page 12 / 49 » Interactive Search Refinement Techniques for HARD Tasks |
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
—This paper presents IQP - a novel approach to bridge the gap between usability of keyword search and expressiveness of database queries. IQP enables a user to start with an arbi...
CHI
2009
ACM
14 years 9 months ago
2009
ACM
People's ability to accurately locate target objects in images is severely affected by the prevalence of the sought objects. This negative effect greatly impacts critical rea...
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
ENTCS
2006
13 years 8 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
SIGIR
2003
ACM
14 years 1 months ago
2003
ACM
Query length in best-match information retrieval (IR) systems is well known to be positively related to effectiveness in the IR task, when measured in experimental, non-interactiv...