Sciweavers

8094 search results - page 16 / 1619
» Improvements in Formula Generalization
Sort
View
ISSAC
2009
Springer
139views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Multihomogeneous resultant formulae for systems with scaled support
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
Ioannis Z. Emiris, Angelos Mantzaflaris
SAT
2007
Springer
75views Hardware» more  SAT 2007»
14 years 1 months ago
Matched Formulas and Backdoor Sets
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes Mr of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched...
Stefan Szeider
IWDW
2005
Springer
14 years 1 months ago
Closed-Form Formulas for Private Watermarking Capacities of Laplacian Sources with the Magnitude-Error Distortion Measure and Un
Calculation of watermarking capacities of private Laplacian watermarking systems with the magnitude-error distortion measure under fixed attacks is addressed. First, in the case o...
Wei Sun, En-Hui Yang
CIARP
2008
Springer
13 years 9 months ago
Structural Construction for On-Line Mathematical Formulae Recognition
We present a method for on-line mathematical formulae recognition based on the structural construction paradigm and twodimensional grammars. In general, this approach can be succes...
Daniel Prusa, Václav Hlavác
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 7 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...