Sciweavers

16 search results - page 3 / 4
» Cryptographic Complexity of Multi-Party Computation Problems...
Sort
View
PR
2008
129views more  PR 2008»
13 years 5 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
BMCBI
2006
158views more  BMCBI 2006»
13 years 5 months ago
Parallelization of multicategory support vector machines (PMC-SVM) for classifying microarray data
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...
Chaoyang Zhang, Peng Li, Arun Rajendran, Youping D...
ICCV
2009
IEEE
13 years 3 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
NIPS
2001
13 years 6 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
14 years 5 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...