Sciweavers

847 search results - page 151 / 170
» Approximation algorithms for projective clustering
Sort
View
ECCV
2006
Springer
15 years 2 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
AAAI
2010
15 years 15 days ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou
LREC
2010
159views Education» more  LREC 2010»
15 years 14 days ago
Improvements in Parsing the Index Thomisticus Treebank. Revision, Combination and a Feature Model for Medieval Latin
The creation of language resources for less-resourced languages like the historical ones benefits from the exploitation of language-independent tools and methods developed over th...
Marco Passarotti, Felice dell'Orletta
ESANN
2003
15 years 12 days ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
CORR
2010
Springer
163views Education» more  CORR 2010»
14 years 11 months ago
Distributed Principal Component Analysis for Wireless Sensor Networks
Abstract: The Principal Component Analysis (PCA) is a data dimensionality reduction technique well-suited for processing data from sensor networks. It can be applied to tasks like ...
Yann-Aël Le Borgne, Sylvain Raybaud, Gianluca...