2983 search results - page 38 / 597 » The group marriage problem |
KDD
1998
ACM
14 years 29 days ago
1998
ACM
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
ASPDAC
2005
ACM
13 years 10 months ago
2005
ACM
- We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis problems to group theory p...
IJNSEC
2011
13 years 3 months ago
2011
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
DAGSTUHL
2006
13 years 10 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...