4095 search results - page 156 / 819 » How to test a tree |
IJCAI
2007
14 years 2 days ago
2007
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
NIPS
2008
14 years 2 days ago
2008
Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
SERP
2003
14 years 6 hour ago
2003
In this paper we present a new approach to writing Makefiles and a system called maker which helps in this process. Our main goals are: ease the process of writing user Makefiles...
AAAI
1997
14 years 5 min ago
1997
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
WWW
2004
ACM
14 years 11 months ago
2004
ACM
The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant infor...