Sciweavers

3690 search results - page 596 / 738
» Computation with classical sequents
Sort
View
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
14 years 10 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
CORR
2004
Springer
119views Education» more  CORR 2004»
14 years 10 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
CSDA
2004
124views more  CSDA 2004»
14 years 10 months ago
Fast and robust discriminant analysis
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the k...
Mia Hubert, Katrien van Driessen
ADAC
2008
193views more  ADAC 2008»
14 years 10 months ago
A constrained-optimization based half-quadratic algorithm for robustly fitting sets of linearly parametrized curves
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...
JACM
2000
119views more  JACM 2000»
14 years 10 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris