2526 search results - page 231 / 506 » A Comparative Evaluation of Name-Matching Algorithms |
130
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
133
click to vote
ICA
2007
Springer
15 years 10 months ago
2007
Springer
We present a robust algorithm for independent component analysis that uses the sum of marginal quadratic negentropies as a dependence measure. It can handle arbitrary source densit...
146
click to vote
SI3D
2006
ACM
15 years 10 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
109
click to vote
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
Despite the existence of a number of procedures for real-parameter optimization using evolutionary algorithms, there is still a need of a systematic and unbiased comparison of di...
136
click to vote
ICTAI
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...