87 search results - page 2 / 18 » How Large is the Set of Disjunctive Sequences |
AIPS
2000
13 years 6 months ago
2000
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
CIE
2010
Springer
13 years 9 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
Visual recognition of human actions in video clips has been an active field of research in recent years. However, most published methods either analyse an entire video and assign ...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
NC
2007
13 years 4 months ago
2007
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an in...