3096 search results - page 170 / 620 » Theory and Use of the EM Algorithm |
146
Voted
WCE
2007
15 years 6 months ago
2007
—The objective of this paper is to study how algorithms of optimization affect the parametersestimation of Autoregressive AR(1)Models. In our research we have represented the AR...
136
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
131
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
140
Voted
ER
2004
Springer
15 years 10 months ago
2004
Springer
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
127
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...