Sciweavers

462 search results - page 72 / 93
» Covering a Tree by a Forest
Sort
View
FASE
2007
Springer
14 years 1 months ago
EQ-Mine: Predicting Short-Term Defects for Software Evolution
We use 63 features extracted from sources such as versioning and issue tracking systems to predict defects in short time frames of two months. Our multivariate approach covers aspe...
Jacek Ratzinger, Martin Pinzger, Harald Gall
ICCBR
2003
Springer
14 years 18 days ago
Index Driven Selective Sampling for CBR
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
Nirmalie Wiratunga, Susan Craw, Stewart Massie
FOCS
2004
IEEE
13 years 11 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
APBC
2004
132views Bioinformatics» more  APBC 2004»
13 years 8 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 8 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis