Sciweavers

247 search results - page 42 / 50
» Superset Learning Based on Generalized Loss Minimization
Sort
View
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
15 years 4 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
SIGMOD
2010
ACM
224views Database» more  SIGMOD 2010»
14 years 10 months ago
GDR: a system for guided data repair
Improving data quality is a time-consuming, labor-intensive and often domain specific operation. Existing data repair approaches are either fully automated or not efficient in int...
Mohamed Yakout, Ahmed K. Elmagarmid, Jennifer Nevi...
FGR
2008
IEEE
164views Biometrics» more  FGR 2008»
14 years 10 months ago
Confidence assessment on eyelid and eyebrow expression recognition
In this paper, we address the recognition of subtle facial expressions by reasoning on the classification confidence. Psychological evidences have determined that eyelids and eyeb...
Javier Orozco, Ognjen Rudovic, F. Xavier Roca, Jor...
ICDM
2008
IEEE
160views Data Mining» more  ICDM 2008»
15 years 4 months ago
Direct Zero-Norm Optimization for Feature Selection
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
Kaizhu Huang, Irwin King, Michael R. Lyu
UAI
2003
14 years 11 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...