6365 search results - page 134 / 1273 » Fast Local Computation Algorithms |
140
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
111
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Reducing the dimension of local descriptors in images is useful to perform pixels comparison faster. We show here that, for enhancing and optimising the computation of the NL-mean...
163
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
123
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
167
click to vote
WWW
2003
ACM
16 years 5 months ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...