Sciweavers

2659 search results - page 464 / 532
» Do we mean the same
Sort
View
BMCBI
2005
94views more  BMCBI 2005»
13 years 10 months ago
Reproducible Clusters from Microarray Research: Whither?
Motivation: In cluster analysis, the validity of specific solutions, algorithms, and procedures present significant challenges because there is no null hypothesis to test and no &...
Nikhil R. Garge, Grier P. Page, Alan P. Sprague, B...
BMCBI
2004
134views more  BMCBI 2004»
13 years 10 months ago
Bayesian model accounting for within-class biological variability in Serial Analysis of Gene Expression (SAGE)
Background: An important challenge for transcript counting methods such as Serial Analysis of Gene Expression (SAGE), "Digital Northern" or Massively Parallel Signature ...
Ricardo Z. N. Vêncio, Helena Brentani, Diogo...
CPC
1999
105views more  CPC 1999»
13 years 9 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill
NLE
2010
127views more  NLE 2010»
13 years 8 months ago
Class-based approach to disambiguating Levin verbs
Lapata and Brew (2004) (hereafter LB04) obtain from untagged texts a statistical prior model that is able to generate class preferences for ambiguous Levin (1993) verbs (hereafter...
Jianguo Li, Chris Brew
SIGSOFT
2010
ACM
13 years 8 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...