Sciweavers

1061 search results - page 61 / 213
» An Experimental Study of Data Migration Algorithms
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Adaptive Data Structures for IP Lookups
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atalla...
BMCBI
2005
147views more  BMCBI 2005»
13 years 8 months ago
Calibration of mass spectrometric peptide mass fingerprint data without specific external or internal calibrants
Background: Peptide Mass Fingerprinting (PMF) is a widely used mass spectrometry (MS) method of analysis of proteins and peptides. It relies on the comparison between experimental...
Witold E. Wolski, Maciej Lalowski, Peter Jungblut,...
APBC
2003
116views Bioinformatics» more  APBC 2003»
13 years 10 months ago
An Empirical Comparison of Supervised Machine Learning Techniques in Bioinformatics
Research in bioinformatics is driven by the experimental data. Current biological databases are populated by vast amounts of experimental data. Machine learning has been widely ap...
Aik Choon Tan, David Gilbert
JCST
2006
65views more  JCST 2006»
13 years 8 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
WWW
2008
ACM
14 years 9 months ago
Using subspace analysis for event detection from web click-through data
Although most of existing research usually detects events by analyzing the content or structural information of Web documents, a recent direction is to study the usage data. In th...
Ling Chen 0002, Yiqun Hu, Wolfgang Nejdl