3394 search results - page 9 / 679 » A Space and Time Efficient Algorithm for SimRank Computation |
DIS
2004
Springer
13 years 11 months ago
2004
Springer
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
IPL
2006
13 years 7 months ago
2006
DAC
2003
ACM
14 years 8 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
ASPDAC
1998
ACM
13 years 11 months ago
1998
ACM
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of proto...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...