46 search results - page 1 / 10 » Two-Stage Computational Cost Reduction Algorithm Based on Ma... |
ICPR
2000
IEEE
13 years 9 months ago
2000
IEEE
For many pattern recognition methods, high recognition accuracy is obtained at very high expense of computational cost. In this paper, a new algorithm that reduces the computation...
ACL
2006
13 years 6 months ago
2006
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...
CVPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
TALG
2010
12 years 11 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
ASPDAC
2010
ACM
13 years 2 months ago
2010
ACM
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...