15033 search results - page 287 / 3007 » Complexity Theory and Algorithms |
134
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
135
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
147
click to vote
LATA
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
129
Voted
SEMWEB
2005
Springer
15 years 10 months ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
129
Voted
SAT
2004
Springer
15 years 10 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...