We were looking at search algorithms – simple ones like linear search and binary search, O(n) vs O log n) – and someone asked me "how often do you think about these things when you are programming?".
Data mining differs from searching, since data mining techniques look for interesting patterns or trends in the data, whereas search algorithms look for relevant discrete pieces of data in a collection, given a query.
We are looking into algorithms for enhancing the quality of multiple sequence alignments so as to improve on secondary structure prediction.
As we said in Section 2, we are looking for an algorithm as general as possible.
So we are looking for another algorithm that is faster, and parallelizable.
In such a case, the on-line flash recognition algorithm, looking for optical transients, can use parallax information to assure that events observed from both sites have parallax angle smaller than the error of astrometry.
ThIs arthink originally appeared on VICE US.
Sean Colbath, a senior scientist at BBN Technologies who works on machine translation, agreed that strange outputs are probably due to Google Translate's algorithm looking for order in chaos.
While we did also assess our main algorithm looking for two codes in the look-back, we found that the loss in sensitivity was not worth the small gain in positive predictive value.
In particular, we look for algorithms designed for implementing the computations in massively parallel processors (MPP).
We therefore look at algorithms for color segmentation, color learning and illumination invariance on mobile robot platforms, including approaches that tackle just the underlying vision problems.
