96 search results - page 16 / 20 » Improved Algorithms for Approximate String Matching (Extende... |
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In contrast to the standard inductive inference setting of predictive machine learning, in real world learning problems often the test instances are already available at ...
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
Abstract— Frequency dependent interconnect analysis is challenging since lumped equivalent circuit models extracted at different frequencies exhibit distinct time and frequency d...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
CPM
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
103
click to vote
HICSS
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...