815 search results - page 128 / 163 » Approximate Entropy Reducts |
174
click to vote
COCOON
2009
Springer
16 years 12 days ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
150
click to vote
ISSAC
2009
Springer
16 years 11 days ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
155
click to vote
SPIN
2009
Springer
16 years 10 days ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
158
Voted
MOBILWARE
2009
ACM
16 years 10 days ago
2009
ACM
The availability of heterogeneous wireless interfaces and of growing computing resources on widespread portable devices pushes for enabling innovative deployment scenarios where mo...
168
click to vote
ICASSP
2008
IEEE
16 years 8 days ago
2008
IEEE
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some commo...