2194 search results - page 22 / 439 » Improving HLRTA*( k ) |
ICDM
2006
IEEE
14 years 5 months ago
2006
IEEE
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...
LATIN
1998
Springer
14 years 3 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
CPAIOR
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
SODA
2008
ACM
14 years 10 days ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
IACR
2011
12 years 10 months ago
2011
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...