69 search results - page 13 / 14 » The nearest polynomial of lower degree |
DM
2010
15 years 10 hour ago
2010
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
JGT
2008
14 years 12 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
81
Voted
CSDA
2006
14 years 12 months ago
2006
Abstract: The method of covariate adjusted regression was recently proposed for situations where both predictors and response in a regression model are not directly observed, but a...
116
click to vote
TON
2010
14 years 6 months ago
2010
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
109
click to vote
ECCC
2010
14 years 10 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...