13603 search results - page 377 / 2721 » On the Complexity of Computing Treelength |
219
click to vote
JMLR
2010
15 years 2 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
184
click to vote
TASLP
2010
15 years 2 months ago
2010
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
182
click to vote
TOG
2010
15 years 2 months ago
2010
In this paper, we propose a simple and efficient framework for simulating dispersed bubble flow. Instead of modeling the complex hydrodynamics of numerous small bubbles explicitly...
182
click to vote
JLP
2010
15 years 6 months ago
2010
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
170
click to vote
IEEECIT
2010
IEEE
15 years 6 months ago
2010
IEEE
—Peer-to-peer computing, involving the participation of thousands of general purpose, public computers, has established itself as a viable paradigm for executing looselycoupled, ...