Sciweavers

121 search results - page 10 / 25
» Improving branch-and-cut performance by random sampling
Sort
View
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
15 years 11 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
CVPR
2005
IEEE
16 years 17 days ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
ICCV
2009
IEEE
16 years 3 months ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
GLVLSI
2006
IEEE
193views VLSI» more  GLVLSI 2006»
15 years 4 months ago
Optimizing noise-immune nanoscale circuits using principles of Markov random fields
As CMOS devices and operating voltages are scaled down, noise and defective devices will impact the reliability of digital circuits. Probabilistic computing compatible with CMOS o...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
JCIT
2010
190views more  JCIT 2010»
14 years 5 months ago
Application of Feature Extraction Method in Customer Churn Prediction Based on Random Forest and Transduction
With the development of telecom business, customer churn prediction becomes more and more important. An outstanding issue in customer churn prediction is high dimensional problem....
Yihui Qiu, Hong Li