Sciweavers

97 search results - page 5 / 20
» Some graphs related to the small Mathieu groups
Sort
View
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
14 years 3 months ago
Querying Communities in Relational Databases
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speci...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
SIGMOD
2005
ACM
150views Database» more  SIGMOD 2005»
14 years 8 months ago
BRAID: Stream Mining through Group Lag Correlations
The goal is to monitor multiple numerical streams, and determine which pairs are correlated with lags, as well as the value of each such lag. Lag correlations (and anticorrelation...
Yasushi Sakurai, Spiros Papadimitriou, Christos Fa...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 8 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
JOC
2007
133views more  JOC 2007»
13 years 8 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
14 years 2 months ago
Limitations of quantum coset states for graph isomorphism
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
Sean Hallgren, Cristopher Moore, Martin Rötte...