874 search results - page 7 / 175 » Faster Algorithms for Semi-Matching Problems |
CODCRY
2011
Springer
12 years 11 months ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
AIPS
2010
13 years 9 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
MOBICOM
2012
ACM
11 years 10 months ago
2012
ACM
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
DAS
2006
Springer
13 years 11 months ago
2006
Springer
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...