574 search results - page 29 / 115 » On the Validity of Hierarchical Decompositions |
ICASSP
2011
IEEE
13 years 13 days ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
DASFAA
2006
IEEE
14 years 11 days ago
2006
IEEE
Sharing of common subtrees has been reported useful not only for XML compression but also for main-memory XML query processing. This method compresses subtrees only when they exhib...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
JMLR
2010
13 years 3 months ago
2010
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
CHI
2002
ACM
14 years 9 months ago
2002
ACM
CPM-GOMS is a modeling method that combines the task decomposition of a GOMS analysis with a model of human resource usage at the level of cognitive, perceptual, and motor operati...