Sciweavers

20 search results - page 3 / 4
» Some polynomials over Q(t) and their Galois groups
Sort
View
IJAC
2007
116views more  IJAC 2007»
13 years 7 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
TIT
1998
73views more  TIT 1998»
13 years 7 months ago
Subspace Subcodes of Reed-Solomon Codes
— In this paper we introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed–Solomon (SSRS) codes. An SSRS code is a subset of a par...
Masayuki Hattori, Robert J. McEliece, Gustave Solo...
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 7 months ago
A complete set of rotationally and translationally invariant features for images
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
Risi Imre Kondor
TCC
2004
Springer
164views Cryptology» more  TCC 2004»
14 years 27 days ago
Hierarchical Threshold Secret Sharing
We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned ...
Tamir Tassa
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 1 months ago
Auditing a Batch of SQL Queries
In this paper, we study the problem of auditing a batch of SQL queries: given a set of SQL queries that have been posed over a database, determine whether some subset of these quer...
Rajeev Motwani, Shubha U. Nabar, Dilys Thomas