2040 search results - page 115 / 408 » Approximate Expectation Maximization |
254
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
147
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
163
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
144
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
117
click to vote
ICMCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Recent work into the separation of mixtures of speech signals has shown some success. One particular method is based on the assumption that scalar mixtures of speech signals have ...