79 search results - page 6 / 16 » Hypertree Decompositions: Structure, Algorithms, and Applica... |
184
click to vote
PRICAI
2000
Springer
15 years 9 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
152
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
167
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
158
click to vote
ACSD
2005
IEEE
15 years 11 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
286
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...