169
Voted
ASAP
2004
IEEE
15 years 7 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
119
click to vote
AIRS
2006
Springer
15 years 7 months ago
2006
Springer
This paper compares the utilization of ConceptNet and WordNet in query expansion. Spreading activation selects candidate terms for query expansion from these two resources. Three m...
170
click to vote
ASAP
2004
IEEE
15 years 7 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
128
click to vote
ASAP
2004
IEEE
15 years 7 months ago
2004
IEEE
Wearable computing systems can be broadly defined as mobile electronic devices that can be unobtrusively embedded in a user's outfit as part of the garment or an accessory. U...
159
click to vote
AIRS
2006
Springer
15 years 7 months ago
2006
Springer
Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant Colony Optimization (ACO) is one such algorithm based on s...