2588 search results - page 19 / 518 » Applications of Kolmogorov complexity to computable model th... |
114
click to vote
DBSEC
2009
15 years 8 days ago
2009
With the rapid growth in wireless networks and sensor and mobile devices, we are moving towards an era of pervasive computing. Access control is challenging in these environments. ...
LOGCOM
2010
14 years 9 months ago
2010
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
101
click to vote
STOC
2007
ACM
15 years 11 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We introduce a robust estimator called generalized projection based M-estimator (gpbM) which does not require the user to specify any scale parameters. For multiple inlier structu...
127
click to vote
AI
2011
Springer
14 years 6 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...