Sciweavers

14 search results - page 3 / 3
» A probabilistic Programming by Demonstration framework handl...
Sort
View
CASES
2004
ACM
13 years 10 months ago
Balancing design options with Sherpa
Application specific processors offer the potential of rapidly designed logic specifically constructed to meet the performance and area demands of the task at hand. Recently, t...
Timothy Sherwood, Mark Oskin, Brad Calder
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 5 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 5 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
AAAI
2006
13 years 6 months ago
Decision Making in Uncertain Real-World Domains Using DT-Golog
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
Mikhail Soutchanski, Huy Pham, John Mylopoulos