Sciweavers

69 search results - page 10 / 14
» Hierarchical A*: Searching Abstraction Hierarchies Efficient...
Sort
View
AAAI
2004
13 years 11 months ago
Learning and Inferring Transportation Routines
This paper introduces a hierarchical Markov model that can learn and infer a user's daily movements through the commue model uses multiple levels of abstraction in order to b...
Lin Liao, Dieter Fox, Henry A. Kautz
SEMWEB
2010
Springer
13 years 7 months ago
Preference-Based Web Service Composition: A Middle Ground between Execution and Search
Abstract. Much of the research on automated Web Service Composition (WSC) relates it to an AI planning task, where the composition is primarily done offline prior to execution. Rec...
Shirin Sohrabi, Sheila A. McIlraith
SIAMMAX
2010
224views more  SIAMMAX 2010»
13 years 4 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
ICS
1992
Tsinghua U.
14 years 1 months ago
The CODE 2.0 graphical parallel programming language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
Peter Newton, James C. Browne
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
14 years 10 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang