1651 search results - page 152 / 331 » Measuring the Complexity of Classification Problems |
BMVC
2010
13 years 6 months ago
2010
Solving the person re-identification problem involves matching observations of individuals across disjoint camera views. The problem becomes particularly hard in a busy public sce...
DAM
2008
13 years 8 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
BMCBI
2007
13 years 8 months ago
2007
Background: Recent development of mass spectrometry technology enabled the analysis of complex peptide mixtures. A lot of effort is currently devoted to the identification of biom...
ALENEX
2010
13 years 9 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
BMCBI
2010
13 years 8 months ago
2010
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...