1629 search results - page 315 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
107
click to vote
TACAS
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
158
click to vote
VLDB
2008
ACM
15 years 10 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
ISPA
2007
Springer
15 years 3 months ago
2007
Springer
In wireless mesh network, by equipped mesh router with multiple radios tuned into orthogonal channels, throughput improvement problem can be alleviated. Efficient channel assignmen...
122
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
BMCBI
2010
14 years 9 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...