521 search results - page 67 / 105 » A Probabilistic Framework for Answer Selection in Question A... |
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
DATAMINE
2007
13 years 7 months ago
2007
We propose a novel context sensitive algorithm for evaluation of ordinal attributes which exploits the information hidden in ordering of attributes’ and class’ values and prov...
SIGIR
2005
ACM
14 years 1 months ago
2005
ACM
The TREC .GOV collection makes a valuable web testbed for distributed information retrieval methods because it is naturally partitioned and includes 725 web-oriented queries with ...