2040 search results - page 150 / 408 » Approximate Expectation Maximization |
125
click to vote
ISAAC
2001
Springer
15 years 7 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
115
Voted
ARCS
2006
Springer
15 years 7 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
117
Voted
ESWS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Despite of their advertisement as task independent representations, the reuse of ontologies in different contexts is difficult. An explanation for this is that when devel...
117
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Efficient design of wireless networks requires implementation of cross-layer algorithms that exploit channel state information. Capitalizing on convex optimization and stochastic...
120
click to vote
NECO
2008
15 years 3 months ago
2008
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...