400 search results - page 49 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
105
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Automatic library generators, such as ATLAS [11], Spiral [8] and FFTW [2], are promising technologies to generate efficient code for different computer architectures. The library...
ESTIMEDIA
2004
Springer
15 years 5 months ago
2004
Springer
We proposed a hardware accelerator IP for the Tier-1 portion of Embedded Block Coding with Optimal Truncation (EBCOT) used in the JPEG2000 next generation image compression standa...
105
click to vote
INFOCOM
1995
IEEE
15 years 3 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...