3394 search results - page 103 / 679 » A Space and Time Efficient Algorithm for SimRank Computation |
PR
2006
13 years 7 months ago
2006
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
MUE
2008
IEEE
14 years 2 months ago
2008
IEEE
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...