2440 search results - page 240 / 488 » Data-Intensive Question Answering |
114
Voted
VLSID
2004
IEEE
16 years 5 months ago
2004
IEEE
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
140
click to vote
CHI
2003
ACM
16 years 5 months ago
2003
ACM
A toilet is not only a place where people answer calls of nature. It is also a place for contemplation and reflection ? and a place where people read information. But bringing thi...
115
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
137
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
137
click to vote
ECIR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a new learning to rank framework for estimating context-sensitive term weights without use of feedback. Specifically, knowledge of effective term weights on ...