3096 search results - page 173 / 620 » Theory and Use of the EM Algorithm |
193
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
148
click to vote
JDA
2008
15 years 6 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
148
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
187
click to vote
AAAI
2008
15 years 8 months ago
2008
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
247
click to vote
SBMF
2010
Springer
15 years 1 months ago
2010
Springer
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...