Sciweavers

4095 search results - page 232 / 819
» How to test a tree
Sort
View
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 6 days ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
BMCBI
2010
140views more  BMCBI 2010»
14 years 10 months ago
An improved machine learning protocol for the identification of correct Sequest search results
Background: Mass spectrometry has become a standard method by which the proteomic profile of cell or tissue samples is characterized. To fully take advantage of tandem mass spectr...
Morten Kallberg, Hui Lu
125
Voted
BMCBI
2006
174views more  BMCBI 2006»
15 years 19 days ago
CARAT: A novel method for allelic detection of DNA copy number changes using high density oligonucleotide arrays
Background: DNA copy number alterations are one of the main characteristics of the cancer cell karyotype and can contribute to the complex phenotype of these cells. These alterati...
Jing Huang, Wen Wei, Joyce Chen, Jane Zhang, Guoyi...
110
Voted
SIGIR
2005
ACM
15 years 6 months ago
Information retrieval system evaluation: effort, sensitivity, and reliability
The effectiveness of information retrieval systems is measured by comparing performance on a common set of queries and documents. Significance tests are often used to evaluate the...
Mark Sanderson, Justin Zobel
CIKM
2008
Springer
15 years 2 months ago
Coreex: content extraction from online news articles
We developed and tested a heuristic technique for extracting the main article from news site Web pages. We construct the DOM tree of the page and score every node based on the amo...
Jyotika Prasad, Andreas Paepcke