Sciweavers

5019 search results - page 4 / 1004
» Computing in Quotient Groups
Sort
View
101
Voted
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
15 years 25 days ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
76
Voted
APAL
1999
90views more  APAL 1999»
14 years 9 months ago
On Distinguishing Quotients of Symmetric Groups
A study is carried out of the elementary theory of quotients of symmetric groups in a similar spirit to [10]. Apart from the trivial and alternating subgroups, the normal subgroup...
Saharon Shelah, J. K. Truss
MOC
2002
113views more  MOC 2002»
14 years 9 months ago
Computation of several cyclotomic Swan subgroups
Let Cl(OK [G]) denote the locally free class group, that is the group of stable isomorphism classes of locally free OK [G]-modules, where OK is the ring of algebraic integers in th...
Timothy Kohl, Daniel R. Replogle
EMMCVPR
2001
Springer
15 years 2 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi
FOCS
2005
IEEE
15 years 3 months ago
Nonembeddability theorems via Fourier analysis
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
Subhash Khot, Assaf Naor