5608 search results - page 371 / 1122 » On the Theory of Matchgate Computations |
207
click to vote
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed t...
188
click to vote
AAAI
2006
15 years 8 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
162
click to vote
AAAI
2006
15 years 8 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
183
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
179
click to vote
COLING
1994
15 years 8 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...