Sciweavers

150 search results - page 30 / 30
» Four Methods for Supervised Word Sense Disambiguation
Sort
View
ICPR
2006
IEEE
14 years 6 months ago
CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images
It is a well documented fact that, for human readers, familiar text is more legible than unfamiliar text. Current-generation computer vision systems also are able to exploit some ...
Jon Louis Bentley, Sui-Yu Wang
SEMWEB
2010
Springer
13 years 2 months ago
Supporting Natural Language Processing with Background Knowledge: Coreference Resolution Case
Systems based on statistical and machine learning methods have been shown to be extremely effective and scalable for the analysis of large amount of textual data. However, in the r...
Volha Bryl, Claudio Giuliano, Luciano Serafini, Ka...
JCST
2006
99views more  JCST 2006»
13 years 4 months ago
A Dialectal Chinese Speech Recognition Framework
Abstract A framework for dialectal Chinese speech recognition is proposed and studied, in which a relatively small dialectal Chinese (or in other words Chinese influenced by the na...
Jing Li, Thomas Zheng, William Byrne, Daniel Juraf...
JMLR
2011
192views more  JMLR 2011»
12 years 11 months ago
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
Paramveer S. Dhillon, Dean P. Foster, Lyle H. Unga...
SIAMSC
2010
142views more  SIAMSC 2010»
12 years 11 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...