Sciweavers

815 search results - page 42 / 163
» Approximate Entropy Reducts
Sort
View
TAMC
2007
Springer
15 years 6 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
MICCAI
1999
Springer
15 years 4 months ago
Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation
Interpolation is required in many medical image processing operations. From sampling theory, it follows that the ideal interpolation kernel is the sinc function, which is of infin...
Erik H. W. Meijering, Wiro J. Niessen, Josien P. W...
JACM
2000
131views more  JACM 2000»
14 years 11 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
ICASSP
2008
IEEE
15 years 6 months ago
Approximation and resampling of tapped delay line channel models with guaranteed channel properties
In this paper, we present a novel framework for resampling and complexity reduction of tapped delay line channel models. In contrast to related algorithms in this field, our fram...
Christian Mehlführer, Markus Rupp
CRYPTO
1994
Springer
128views Cryptology» more  CRYPTO 1994»
15 years 4 months ago
Linear Cryptanalysis Using Multiple Approximations
We present a technique which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. We note the limit...
Burton S. Kaliski Jr., Matthew J. B. Robshaw