459 search results - page 41 / 92 » Computational Complexity of Probabilistic Disambiguation |
COCO
2007
Springer
15 years 6 months ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
101
click to vote
BIBE
2007
IEEE
15 years 6 months ago
2007
IEEE
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
112
click to vote
EGPGV
2004
Springer
15 years 5 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
101
click to vote
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
UAI
2004
15 years 1 months ago
2004
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...