Sciweavers

29 search results - page 6 / 6
» Noisy Interpolating Sets for Low Degree Polynomials
Sort
View
ECCV
2006
Springer
14 years 7 months ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté
BMCBI
2006
144views more  BMCBI 2006»
13 years 5 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
13 years 9 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
ICANN
2005
Springer
13 years 10 months ago
Handwritten Digit Recognition with Nonlinear Fisher Discriminant Analysis
Abstract. To generalize the Fisher Discriminant Analysis (FDA) algorithm to the case of discriminant functions belonging to a nonlinear, finite dimensional function space F (Nonli...
Pietro Berkes