Sciweavers

2631 search results - page 218 / 527
» A Practical Method for the Sparse Resultant
Sort
View
BMCBI
2010
158views more  BMCBI 2010»
15 years 7 months ago
Validation of differential gene expression algorithms: Application comparing fold-change estimation to hypothesis testing
Background: Sustained research on the problem of determining which genes are differentially expressed on the basis of microarray data has yielded a plethora of statistical algorit...
Corey M. Yanofsky, David R. Bickel
BMCBI
2005
160views more  BMCBI 2005»
15 years 7 months ago
Data-poor categorization and passage retrieval for Gene Ontology Annotation in Swiss-Prot
Background: In the context of the BioCreative competition, where training data were very sparse, we investigated two complementary tasks: 1) given a Swiss-Prot triplet, containing...
Frédéric Ehrler, Antoine Geissbü...
ICCV
2001
IEEE
16 years 9 months ago
Computing Visual Correspondence with Occlusions via Graph Cuts
Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do no...
Vladimir Kolmogorov, Ramin Zabih
ICML
2007
IEEE
16 years 8 months ago
On the value of pairwise constraints in classification and consistency
In this paper we consider the problem of classification in the presence of pairwise constraints, which consist of pairs of examples as well as a binary variable indicating whether...
Jian Zhang, Rong Yan
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
16 years 1 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt