2492 search results - page 272 / 499 » On the General Signature Trees |
154
click to vote
AI
2000
Springer
15 years 6 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
142
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
We generalize our results of [8, 9] and propose a new framework of multitree dictionaries which include many previously proposed dictionaries as well as many new, very large, tree...
152
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
146
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
187
click to vote
CEC
2008
IEEE
16 years 19 days ago
2008
IEEE
—Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...