4263 search results - page 391 / 853 » Learning without Coding |
158
click to vote
DAS
2010
Springer
15 years 10 months ago
2010
Springer
This paper addresses how to quickly recognize a character pattern using a lot of case examples without learning. Here without learning means just finding the most similar example...
168
click to vote
ASC
2004
15 years 6 months ago
2004
In this paper, we describe development of a mobile robot which does unsupervised learning for recognizing an environment from action sequences. We call this novel recognition appr...
175
click to vote
EMNLP
2009
15 years 4 months ago
2009
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
226
click to vote
COMBINATORICA
2010
15 years 4 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
227
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...