1921 search results - page 160 / 385 » Making AC-3 an Optimal Algorithm |
129
click to vote
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
15 years 2 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
117
Voted
ICDAR
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we present a new approach to the temporal order restoration of the off-line handwriting. After the preprocessing steps of the word image, a suitable algorithm makes...
108
Voted
SDM
2003
SIAM
15 years 3 months ago
2003
SIAM
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
118
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
—We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence futu...
106
click to vote
ICIP
2008
IEEE
15 years 8 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...