467 search results - page 38 / 94 » Processing top k queries from samples |
NIPS
2000
13 years 10 months ago
2000
Bayesian networks are graphical representations of probability distributions. In virtually all of the work on learning these networks, the assumption is that we are presented with...
IDEAS
2007
IEEE
14 years 3 months ago
2007
IEEE
Constraint-based database caching aims at correctly answering SQL query predicates from a local cache database by exploiting constraints that have previously been used in selectin...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
Pseudo-relevance feedback (PRF) via query-expansion has been proven to be effective in many information retrieval (IR) tasks. In most existing work, the top-ranked documents from...
ICASSP
2011
IEEE
13 years 27 days ago
2011
IEEE
In this paper, we describe methods to exploit search queries mined from search engine query logs to improve domain detection in spoken language understanding. We propose extending...
COMAD
2009
13 years 10 months ago
2009
In this paper, we present a feasibility study in automating the insurance claims processing system related to automotive sector. In automobile insurance claims processing, usually...