50 search results - page 8 / 10 » Improved Algorithms for the K-Maximum Subarray Problem for S... |
FOCS
2004
IEEE
13 years 11 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...
LATIN
1998
Springer
13 years 11 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
ICITA
2005
IEEE
14 years 29 days ago
2005
IEEE
Small-sample learning in image retrieval is a pertinent and interesting problem. Relevance feedback is an active area of research that seeks to find algorithms that are robust wi...
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
ICCBR
2003
Springer
14 years 17 days ago
2003
Springer
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...