1418 search results - page 68 / 284 » Schema polynomials and applications |
158
click to vote
MMSEC
2006
ACM
16 years 2 days ago
2006
ACM
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
188
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
157
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
172
click to vote
SMA
2010
ACM
15 years 6 months ago
2010
ACM
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
189
click to vote
ER
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...