2194 search results - page 7 / 439 » Improving HLRTA*( k ) |
DIS
2007
Springer
14 years 1 months ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
SIAMCOMP
1998
13 years 9 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
SIGIR
2002
ACM
13 years 9 months ago
2002
ACM
: This paper analyzes category score algorithms for k-NN classifier found in the literature, including majority voting algorithm (MVA), simple sum algorithm (SSA), etc. MVA and SS...
JCP
2007
13 years 9 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
ALGORITHMICA
2006
13 years 10 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...