Sciweavers

192 search results - page 17 / 39
» Boolean Matching Using Generalized Reed-Muller Forms
Sort
View
DCC
2001
IEEE
15 years 11 months ago
On Zador's Entropy-Constrained Quantization Theorem
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...
Robert M. Gray, Jia Li
FOCS
2009
IEEE
15 years 6 months ago
Linear Systems over Composite Moduli
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...
Arkadev Chattopadhyay, Avi Wigderson
TIT
2002
68views more  TIT 2002»
14 years 11 months ago
A Lagrangian formulation of Zador's entropy-constrained quantization theorem
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...
Robert M. Gray, Tamás Linder, Jia Li
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 4 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
ACSC
2006
IEEE
15 years 5 months ago
Programming with heterogeneous structures: manipulating XML data using bondi
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...
F. Y. Huang, C. B. Jay, David B. Skillicorn