Sciweavers

815 search results - page 128 / 163
» Approximate Entropy Reducts
Sort
View
COCOON
2009
Springer
15 years 6 months ago
On the Readability of Monotone Boolean Formulae
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 ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
15 years 6 months ago
H-LLL: using householder inside LLL
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 ...
Ivan Morel, Damien Stehlé, Gilles Villard
SPIN
2009
Springer
15 years 6 months ago
Fast, All-Purpose State Storage
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 ...
Peter C. Dillinger, Panagiotis Manolios
MOBILWARE
2009
ACM
15 years 6 months ago
Middleware Solutions for Self-organizing Multi-hop Multi-path Internet Connectivity Based on Bluetooth
The availability of heterogeneous wireless interfaces and of growing computing resources on widespread portable devices pushes for enabling innovative deployment scenarios where mo...
Paolo Bellavista, Carlo Giannelli
ICASSP
2008
IEEE
15 years 6 months ago
Distributed compressed sensing: Sparsity models and reconstruction algorithms using annihilating filter
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...
Ali Hormati, Martin Vetterli