390 search results - page 59 / 78 » Computing shortest paths for any number of hops |
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
104
click to vote
ICIP
1994
IEEE
16 years 3 months ago
1994
IEEE
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
125
click to vote
CSFW
2007
IEEE
15 years 8 months ago
2007
IEEE
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
121
click to vote
PVLDB
2008
15 years 1 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
116
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...