Sciweavers

903 search results - page 28 / 181
» On the reduction of a random basis
Sort
View
ACL
2008
15 years 3 months ago
Word Clustering and Word Selection Based Feature Reduction for MaxEnt Based Hindi NER
Statistical machine learning methods are employed to train a Named Entity Recognizer from annotated data. Methods like Maximum Entropy and Conditional Random Fields make use of fe...
Sujan Kumar Saha, Pabitra Mitra, Sudeshna Sarkar
RSFDGRC
2005
Springer
100views Data Mining» more  RSFDGRC 2005»
15 years 7 months ago
A Hybrid Approach to MR Imaging Segmentation Using Unsupervised Clustering and Approximate Reducts
Abstract. We introduce a hybrid approach to magnetic resonance image segmentation using unsupervised clustering and the rules derived from approximate decision reducts. We utilize ...
Sebastian Widz, Kenneth Revett, Dominik Slezak
ICPR
2010
IEEE
15 years 6 months ago
On the Dimensionality Reduction for Sparse Representation Based Face Recognition
Face recognition (FR) is an active yet challenging topic in computer vision applications. As a powerful tool to represent high dimensional data, recently sparse representation bas...
Lei Zhang, Meng Yang, Zhizhao Feng, David Zhang
CORR
2007
Springer
146views Education» more  CORR 2007»
15 years 1 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
TIT
2008
121views more  TIT 2008»
15 years 1 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut