3096 search results - page 166 / 620 » Theory and Use of the EM Algorithm |
144
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
149
Voted
AAAI
1994
15 years 6 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
154
click to vote
SODA
1992
ACM
15 years 6 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
128
click to vote
ICCD
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper we present algorithmic and architectural methodology for building Particle Filters in hardware. Particle filtering is a new paradigm for filtering in presence of n...
162
click to vote
NLPRS
2001
Springer
15 years 9 months ago
2001
Springer
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...