239 search results - page 22 / 48 » A Simple Algorithm for Computing the Lempel Ziv Factorizatio... |
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
GC
2002
Springer
13 years 7 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other...
DIS
2007
Springer
14 years 1 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
EUROPAR
2005
Springer
14 years 28 days ago
2005
Springer
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...