2194 search results - page 147 / 439 » Improving HLRTA*( k ) |
163
click to vote
FSKD
2009
Springer
15 years 11 months ago
2009
Springer
—This paper presents some preliminary experimental results on RegionBoost, which is a typical example of a class of Boosting algorithms based on dynamic weighting schemes. It is ...
227
click to vote
CPM
1998
Springer
15 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
193
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...
176
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
213
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...