2430 search results - page 114 / 486 » Computing Tutte Polynomials |
142
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
117
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
134
click to vote
ALMOB
2008
15 years 5 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
144
click to vote
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
174
click to vote
STACS
2012
Springer
14 years 17 days ago
2012
Springer
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...