Sciweavers

2414 search results - page 5 / 483
» Computing Normal Subgroups
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
11 years 10 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
APPML
2010
112views more  APPML 2010»
13 years 7 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
COMBINATORICS
2007
65views more  COMBINATORICS 2007»
13 years 7 months ago
On Certain Integral Schreier Graphs of the Symmetric Group
We compute the spectrum of the Schreier graph of the symmetric group Sn corresponding to the Young subgroup S2 × Sn−2 and the generating set consisting of initial reversals. In ...
Paul E. Gunnells, Richard A. Scott, Byron L. Walde...
COMPLIFE
2006
Springer
13 years 11 months ago
Relational Subgroup Discovery for Descriptive Analysis of Microarray Data
Abstract. This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to help find description of groups of genes different...
Igor Trajkovski, Filip Zelezný, Jakub Tolar...
ACISP
2001
Springer
13 years 12 months ago
Private Information Retrieval Based on the Subgroup Membership Problem
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Akihiro Yamamura, Taiichi Saito