4860 search results - page 442 / 972 » SNPs Problems, Complexity, and Algorithms |
122
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
163
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
226
Voted
PODS
2009
ACM
16 years 4 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
127
Voted
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
174
click to vote
ML
2000
ACM
15 years 3 months ago
2000
ACM
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...