3394 search results - page 98 / 679 » A Space and Time Efficient Algorithm for SimRank Computation |
IPPS
1998
IEEE
14 years 3 days ago
1998
IEEE
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
ENC
2004
IEEE
13 years 11 months ago
2004
IEEE
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
ICPR
2002
IEEE
14 years 24 days ago
2002
IEEE
Kernel functions can be viewed as a non-linear transformation that increases the separability of the input data by mapping them to a new high dimensional space. The incorporation ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...