2168 search results - page 48 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
RSA
2002
13 years 8 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
CPHYSICS
2011
13 years 4 months ago
2011
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
MP
2006
13 years 9 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
ADT
2010
13 years 9 months ago
2010
Abstract A wide range of wireless system developments require knowledge of the distribution of electromagnetic fields from various sources in humans. As experimental assessment is ...
INFOCOM
2011
IEEE
13 years 21 days ago
2011
IEEE
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...