Sciweavers

679 search results - page 119 / 136
» Algorithmic modifications to SPIHT
Sort
View
88
Voted
BMCBI
2007
133views more  BMCBI 2007»
14 years 11 months ago
An efficient pseudomedian filter for tiling microrrays
Background: Tiling microarrays are becoming an essential technology in the functional genomics toolbox. They have been applied to the tasks of novel transcript identification, elu...
Thomas E. Royce, Nicholas Carriero, Mark B. Gerste...
JACM
2006
99views more  JACM 2006»
14 years 11 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
TASLP
2002
67views more  TASLP 2002»
14 years 11 months ago
Efficient tracking of the cross-correlation coefficient
In many (audio) processing algorithms, involving manipulation of discrete-time signals, the performance can vary strongly over the repertoire that is used. This may be the case whe...
Ronald M. Aarts, Roy Irwan, Augustus J. E. M. Jans...
WWW
2004
ACM
16 years 12 days ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 4 days ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen