192 search results - page 17 / 39 » Boolean Matching Using Generalized Reed-Muller Forms |
95
Voted
DCC
2001
IEEE
16 years 2 months ago
2001
IEEE
Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorith...
118
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
91
Voted
TIT
2002
15 years 2 months ago
2002
Abstract--Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd...
125
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
119
Voted
ACSC
2006
IEEE
15 years 9 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...