3136 search results - page 78 / 628 » Comparison of Clique-Listing Algorithms |
119
click to vote
MOC
1998
15 years 5 months ago
1998
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
152
click to vote
ICDAR
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we describe a synthetic database composed of 273,452 handwritten touching digits pairs to assess segmentation algorithms. It contains several different kinds of touc...
180
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we present self-adaptive differential evolution algorithm jDElsgo on large scale global optimization. The experimental results obtained by our algorithm on benchmark ...
191
click to vote
CAI
2010
Springer
15 years 3 months ago
2010
Springer
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
159
click to vote
IDEAL
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...