12264 search results - page 222 / 2453 » An Analysis of the XSL Algorithm |
161
click to vote
CIMCA
2005
IEEE
16 years 4 days ago
2005
IEEE
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
163
click to vote
SACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
175
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
178
click to vote
VMV
2001
15 years 8 months ago
2001
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
157
click to vote
IJFCS
2008
15 years 6 months ago
2008
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...