Sciweavers

1004 search results - page 84 / 201
» Product representations of polynomials
Sort
View
AAECC
2004
Springer
87views Algorithms» more  AAECC 2004»
14 years 9 months ago
DFT-based Word Normalization in Finite Supersolvable Groups
Abstract. In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of th...
Meinard Müller, Michael Clausen
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
14 years 9 months ago
The Complexity of the A B C Problem
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
ACS
2005
14 years 9 months ago
Measurable Categories
A `2-group' is a category equipped with a multiplication satisfying laws like those of a group. Just as groups have representations on vector spaces, 2-groups have representa...
D. Yetter
ICIP
2008
IEEE
15 years 11 months ago
A near optimal coder for image geometry with adaptive partitioning
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...
Arian Maleki, Morteza Shahram, Gunnar Carlsson
LICS
2008
IEEE
15 years 4 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...