4708 search results - page 229 / 942 » Generating the Structure of Argument |
180
click to vote
TNN
1998
15 years 6 months ago
1998
—Structural learning with forgetting is an established method of using Laplace regularization to generate skeletal artificial neural networks. In this paper we develop a continu...
184
click to vote
IJAR
2010
15 years 5 months ago
2010
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
186
click to vote
PCM
2010
Springer
15 years 5 months ago
2010
Springer
A fast and robust 3D retrieval method is proposed based on a novel weighted structural histogram representation. Our method has the following steps: 1) adaptively segment any 3D sh...
209
click to vote
KDD
2008
ACM
2008
ACM
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
16 years 7 months ago
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
181
click to vote
RTA
2004
Springer
15 years 12 months ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...