Sciweavers

1248 search results - page 217 / 250
» On the Number of Birch Partitions
Sort
View
134
Voted
BMCBI
2010
143views more  BMCBI 2010»
15 years 26 days ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
81
Voted
BMCBI
2007
79views more  BMCBI 2007»
15 years 26 days ago
Orthology prediction at scalable resolution by phylogenetic tree analysis
Background: Orthology is one of the cornerstones of gene function prediction. Dividing the phylogenetic relations between genes into either orthologs or paralogs is however an ove...
René T. J. M. van der Heijden, Berend Snel,...
114
Voted
BMCBI
2006
94views more  BMCBI 2006»
15 years 24 days ago
Noise-injected neural networks show promise for use on small-sample expression data
Background: Overfitting the data is a salient issue for classifier design in small-sample settings. This is why selecting a classifier from a constrained family of classifiers, on...
Jianping Hua, James Lowey, Zixiang Xiong, Edward R...
108
Voted
PAMI
2008
152views more  PAMI 2008»
15 years 21 days ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
115
Voted
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 20 days ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...