2150 search results - page 136 / 430 » On a restricted cross-intersection problem |
117
Voted
AIML
2004
15 years 6 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
167
Voted
AIML
2004
15 years 6 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
188
click to vote
AMAI
1999
Springer
15 years 4 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
230
click to vote
ICDE
2003
IEEE
16 years 6 months ago
2003
IEEE
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
125
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...