Sciweavers

1859 search results - page 114 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
ICML
2006
IEEE
16 years 5 months ago
Fast time series classification using numerosity reduction
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...
Xiaopeng Xi, Eamonn J. Keogh, Christian R. Shelton...
NIPS
2008
15 years 6 months ago
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
Shenghuo Zhu, Kai Yu, Yihong Gong
GPEM
2006
97views more  GPEM 2006»
15 years 5 months ago
Evolving recursive programs by using adaptive grammar based genetic programming
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...
Man Wong
ACL
2009
15 years 2 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
120
Voted
JMLR
2010
88views more  JMLR 2010»
14 years 11 months ago
Inference and Learning in Networks of Queues
Probabilistic models of the performance of computer systems are useful both for predicting system performance in new conditions, and for diagnosing past performance problems. The ...
Charles A. Sutton, Michael I. Jordan