8728 search results - page 234 / 1746 » On Reduct Construction Algorithms |
145
Voted
RC
2006
15 years 6 months ago
2006
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimension...
166
Voted
ICMCS
2005
IEEE
16 years 6 days ago
2005
IEEE
This paper presents an efficient method for the conversion between subband domain representations of different filter banks. It advantageously replaces the conventional cascade of...
143
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
141
click to vote
AAECC
1995
Springer
15 years 10 months ago
1995
Springer
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
163
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...