121 search results - page 12 / 25 » First-Order Queries over One Unary Function |
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
In the recent years, the Web has been rapidly “deepened” with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query i...
131
click to vote
PODS
1994
ACM
15 years 3 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
STOC
1993
ACM
15 years 3 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
BMCBI
2007
14 years 12 months ago
2007
Background: Due to the complex and distributed nature of biological research, our current biological knowledge is spread over many redundant annotation databases maintained by man...
102
click to vote
KDD
2009
ACM
16 years 8 days ago
2009
ACM
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...