Sciweavers

1554 search results - page 145 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
154
Voted
FMSD
2002
107views more  FMSD 2002»
15 years 3 months ago
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
Sergey Berezin, Edmund M. Clarke, Armin Biere, Yun...
121
Voted
NIPS
2004
15 years 4 months ago
Face Detection - Efficient and Rank Deficient
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
Wolf Kienzle, Gökhan H. Bakir, Matthias O. Fr...
104
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Design of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ï...
Xi Zhang
114
Voted
TIP
1998
109views more  TIP 1998»
15 years 3 months ago
Optimum design of chamfer distance transforms
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...
Muhammad Akmal Butt, Petros Maragos
PKDD
2009
Springer
144views Data Mining» more  PKDD 2009»
15 years 10 months ago
Compositional Models for Reinforcement Learning
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
Nicholas K. Jong, Peter Stone