463 search results - page 33 / 93 » The Most Reliable Subgraph Problem |
ISSTA
1996
ACM
15 years 6 months ago
1996
ACM
In assessing the quality of software, we would like to make engineering judgements similar to those based on statistical quality control. Ideally, we want to support statements li...
126
click to vote
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...
125
Voted
CPM
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
121
Voted
DSN
2003
IEEE
15 years 7 months ago
2003
IEEE
Computer-based advisory systems form with their users composite, human-machine systems. Redundancy and diversity between the human and the machine are often important for the depe...
123
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...