4355 search results - page 377 / 871 » Increasing Kolmogorov Complexity |
191
click to vote
CCS
2009
ACM
16 years 7 months ago
2009
ACM
The successful deployment of a security policy is closely related not only to the complexity of the security requirements but also to the capabilities/functionalities of the secur...
232
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
183
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We use clustering to derive new relations which augment database schema used in automatic generation of predictive features in statistical relational learning. Clustering improves...
203
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Web Usage Mining refers to the discovery of interesting information from user navigational behavior as stored in web access logs. While extracting simple information from web logs...
182
click to vote
HPCA
2001
IEEE
16 years 7 months ago
2001
IEEE
This paper presents a new method for branch prediction. The key idea is to use one of the simplest possible neural networks, the perceptron as an alternative to the commonly used ...