4403 search results - page 292 / 881 » Galois Theory of Algorithms |
189
click to vote
JSAC
2006
15 years 6 months ago
2006
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
150
click to vote
FOCM
2007
15 years 6 months ago
2007
We provide an algebraic formulation of the moving frame method for constructing local smooth invariants on a manifold under an action of a Lie group. This formulation gives rise t...
188
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
175
click to vote
AAECC
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
141
Voted
JOLLI
2002
15 years 6 months ago
2002
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...