1487 search results - page 86 / 298 » The Computational Complexity of Link Building |
143
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
134
Voted
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
161
click to vote
DSN
2011
IEEE
14 years 3 months ago
2011
IEEE
—We consider the problem of inferring link loss rates using passive measurements. Prior inference approaches are mainly built on the time correlation nature of packet losses. How...
121
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
164
click to vote
UAI
2007
15 years 5 months ago
2007
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...