2944 search results - page 311 / 589 » Improving Bound Propagation |
209
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
178
click to vote
JGT
2010
15 years 1 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
136
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper studies conditions under which a signal can be reconstructed from partial frequency content. We focus on signals in shiftinvariant spaces generated by multiple generato...
243
click to vote
ARITH
2011
IEEE
14 years 6 months ago
2011
IEEE
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
344
click to vote
Publication
Location discovery is a fundamental problem in wireless ad hoc networks. Most of the ad hoc routing protocols use some form of flooding to discover the location and route of a mobi...