Sciweavers

80 search results - page 15 / 16
» Efficient Multivariate Factorization over Finite Fields
Sort
View
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 6 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
IEEEARES
2007
IEEE
14 years 16 days ago
Broadcast Authentication Protocol with Time Synchronization and Quadratic Residues Chain
Assuring information authenticity is an important issue in the field of information security. A new broadcast authentication protocol is proposed. The protocol is based on time sy...
Bogdan Groza
FOCS
1999
IEEE
13 years 10 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
AMC
2004
108views more  AMC 2004»
13 years 6 months ago
A variational approach to magnetic resonance coil sensitivity estimation
Abstract. A variational method for estimating a magnetic resonance coil sensitivity from its corresponding nonuniform illumination of magnetic resonance images is proposed and anal...
Stephen L. Keeling, Roland Bammer
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 6 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...