Sciweavers

1297 search results - page 108 / 260
» fews 2007
Sort
View
BIOINFORMATICS
2005
109views more  BIOINFORMATICS 2005»
14 years 11 months ago
Prediction error estimation: a comparison of resampling methods
In genomic studies, thousands of features are collected on relatively few samples. One of the goals of these studies is to build classifiers to predict the outcome of future obser...
Annette M. Molinaro, Richard Simon, Ruth M. Pfeiff...
BMCBI
2005
150views more  BMCBI 2005»
14 years 11 months ago
Approaching the taxonomic affiliation of unidentified sequences in public databases - an example from the mycorrhizal fungi
Background: During the last few years, DNA sequence analysis has become one of the primary means of taxonomic identification of species, particularly so for species that are minut...
R. Henrik Nilsson, Erik Kristiansson, Martin Ryber...
JCP
2007
96views more  JCP 2007»
14 years 11 months ago
A Language to Enable Distributed Simulation of Extended Queueing Networks
— Distributed simulators are increasingly being used for their intrinsic advantages in terms of reusability, fault tolerance, performance, and geographic distribution. The develo...
Daniele Gianni, Andrea D'Ambrogio
JCT
2007
93views more  JCT 2007»
14 years 11 months ago
Generating bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
Serguei Norine, Robin Thomas
JCT
2007
96views more  JCT 2007»
14 years 11 months ago
Co-degree density of hypergraphs
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
Dhruv Mubayi, Yi Zhao