I am using C++ GDI, StretchDIBits to draw images on DC. Because the original Image is large, and high quality is needed. I use HAFTONE mode, to draw whole image on DC(zoom the image) seems time comsuming. So I decide to draw partially using StretchDIBits. But there is a serious problem about StretchDIBits. I can only draw rect in int...
We have a database of movies and series, and as the data comes from many sources of varying reliability, we'd like to be able to do fuzzy string matching on the titles of episodes. We are using Solr for search in our application, but the default matching mechanisms operate on word levels, which is not good enough for short strings, like ...
I have likelihood functions LFi,i=1,2 with parameters [lambda,p] and [lambda]: LF1<-lambda^sp^(n-n0)(1-p)^n0/((1-1/exp(lambda))^(n-n0)(exp(lambda))^(n-n0)); LF2<-lambda^s/(exp(lambda))^n where s is the sum of observed counts, n is the number of observations, and n0 is the number of observed zeros. As usual, maximised log(LFi)s and AI...
Using C, I'm trying to find the location and number of matches of a substring within another parent string. Because I also need to include approximate (hamming distance) matches, I'm using the tre library found here: http://laurikari.net/tre/. I'm having trouble understanding some of the documentation on the site, likely because I'm no...
Hi All, Consider an array of integers (assumed to be sorted); I would like to find the array index of the integer that is closest to a given integer in the fastest possible way. And the case where there are multiple possibilities, the algorithm should identify all. Example: consider T=(3, 5, 24, 65, 67, 87, 129, 147, 166), and if the g...
I have the following model and instance: class Bashable(models.Model): name = models.CharField(max_length=100) >>> foo = Bashable.objects.create(name=u"piñata") Now I want to be able to search for objects, but using ascii characters rather than unicode, something like this: >>> Bashable.objects.filter(name__lookslike="pinata") ...
I am running a long indexing process. I know there is no concrete way of knowing the remaining time for the process, but how can one get a rough estimation I read somewhere that I can get some approximation by looking at the size of the table before the indexing and comparing that with size of the temp table being created. Is this true?...
Hi I need to find 1.mismatch(incorrectly played notes), 2.insertion(additional played), & 3.deletion (missed notes), in a music piece (e.g. note pitches [string values] stored in a table) against a reference music piece. This is either possible through exact string matching algorithms or dynamic programming/ approximate string matching...
Hi there. I'm working on an application with statistic analysis, and I need some help. Given a set of n points, how can I approximate a line by them. I'm sure there is an algorithm but I couldn't find it. Thanks! ...
I have just written some code for approximate string matching. I would like to benchmark my naive algorithm against a more mature implementation running on the JVM. Any suggestions? ...