1461 search results - page 161 / 293 » Complexity of Graph Covering Problems |
PAMI
2010
13 years 4 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
DAS
2010
Springer
14 years 2 months ago
2010
Springer
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
CVPR
2011
IEEE
13 years 6 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...