1898 search results - page 103 / 380 » Weak Keys for IDEA |
144
Voted
DATESO
2007
15 years 5 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
118
Voted
STRINGOLOGY
2008
15 years 5 months ago
2008
In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
154
Voted
UAI
2001
15 years 5 months ago
2001
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
127
Voted
SEC
2003
15 years 5 months ago
2003
: The paper contains presentation of a framework, which would significantly increase quality of information security products and procedures, and Commentary on difficulties of impl...
97
Voted
ICMAS
2000
15 years 5 months ago
2000
This paper describes a multiagent variant of Dyna-Q called M-Dyna-Q. Dyna-Q is an integrated single-agent framework for planning, reacting, and learning. Like DynaQ, M-Dyna-Q empl...