Sciweavers

11321 search results - page 188 / 2265
» Improvements to Turing's method
Sort
View
BMCBI
2006
139views more  BMCBI 2006»
15 years 6 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
AI
2002
Springer
15 years 6 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
196
Voted
ASPLOS
2011
ACM
14 years 10 months ago
Improving the performance of trace-based systems by false loop filtering
Trace-based compilation is a promising technique for language compilers and binary translators. It offers the potential to expand the compilation scopes that have traditionally be...
Hiroshige Hayashizaki, Peng Wu, Hiroshi Inoue, Mau...
COMPGEOM
2006
ACM
16 years 18 days ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
CSB
2003
IEEE
111views Bioinformatics» more  CSB 2003»
15 years 12 months ago
A Block Coding Method that Leads to Significantly Lower Entropy Values for the Proteins and Coding Sections of Haemophilus influ
A simple statistical block code in combination with the LZW-based compression utilities gzip and compress has been found to increase by a significant amount the level of compressi...
G. Sampath