Sciweavers

2944 search results - page 108 / 589
» Improving Bound Propagation
Sort
View
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 10 months ago
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
M. A. Iwen
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 10 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
CVPR
2011
IEEE
13 years 6 months ago
Natural Image Denoising: Optimality and Inherent Bounds
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
Anat Levin, Boaz Nadler
VLSID
2002
IEEE
95views VLSI» more  VLSID 2002»
14 years 10 months ago
A Novel Method to Improve the Test Efficiency of VLSI Tests
This paper considers reducing the cost of test application by permuting test vectors to improve their defect coverage. Algorithms for test reordering are developed with the goal o...
Hailong Cui, Sharad C. Seth, Shashank K. Mehta
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 10 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen