2297 search results - page 116 / 460 » A fast APRIORI implementation |
140
click to vote
ICIP
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
124
Voted
KDD
2007
ACM
16 years 5 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
224
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
169
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
130
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Fault tolerance is an important issue for large machines with tens or hundreds of thousands of processors. Checkpoint-based methods, currently used on most machines, rollback all ...