2107 search results - page 20 / 422 » Computing Small Search Numbers in Linear Time |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
ICPP
2003
IEEE
14 years 28 days ago
2003
IEEE
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
BMCBI
2008
13 years 7 months ago
2008
Background: Identifying quantitative trait loci (QTL) for both additive and epistatic effects raises the statistical issue of selecting variables from a large number of candidates...