1542 search results - page 50 / 309 » Kernelization of packing problems |
PR
2008
14 years 11 months ago
2008
It is generally believed that quadratic discriminant analysis (QDA) can better fit the data in practical pattern recognition applications compared to linear discriminant analysis ...
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
100
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
ANTSW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
JCSS
2010
14 years 10 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...