Sciweavers

1165 search results - page 68 / 233
» Effective linear programming based placement methods
Sort
View
EMNLP
2009
15 years 5 days ago
The Feature Subspace Method for SMT System Combination
Recently system combination has been shown to be an effective way to improve translation quality over single machine translation systems. In this paper, we present a simple and ef...
Nan Duan, Mu Li, Tong Xiao, Ming Zhou
124
Voted
ICPR
2004
IEEE
16 years 3 months ago
Bayesian Face Recognition Based on Gaussian Mixture Models
Bayesian analysis is a popular subspace based face recognition method. It casts the face recognition task into a binary classification problem with each of the two classes, intrap...
Xiaogang Wang, Xiaoou Tang
105
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Quantifying perturbations in temporal dynamics for automated assessment of spastic dysarthric speech intelligibility
Spastic dysarthric speech is often associated with imprecise placement of articulators which, in turn, cause perturbations in speech temporal dynamics, such as unclear distinction...
Tiago H. Falk, Richard Hummel, Wai-Yip Chan
157
Voted
SCAM
2002
IEEE
15 years 7 months ago
Dynamic Slicing Object-Oriented Programs for Debugging
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
Baowen Xu, Zhenqiang Chen, Hongji Yang
CPAIOR
2006
Springer
15 years 6 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu