Sciweavers

3818 search results - page 82 / 764
» Word Problems on Compressed Words
Sort
View
SIAMMAX
2010
224views more  SIAMMAX 2010»
14 years 11 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
ACL
2009
15 years 2 months ago
Compiling a Massive, Multilingual Dictionary via Probabilistic Inference
Can we automatically compose a large set of Wiktionaries and translation dictionaries to yield a massive, multilingual dictionary whose coverage is substantially greater than that...
Mausam, Stephen Soderland, Oren Etzioni, Daniel S....
SAC
2005
ACM
15 years 10 months ago
Retrieving lightly annotated images using image similarities
Users’ search needs are often represented by words and images are retrieved according to such textual queries. Annotation words assigned to the stored images are most useful to ...
Masashi Inoue, Naonori Ueda
COCOON
2009
Springer
15 years 7 months ago
Three New Algorithms for Regular Language Enumeration
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
Margareta Ackerman, Erkki Mäkinen
LREC
2010
313views Education» more  LREC 2010»
15 years 6 months ago
A Persian Part-Of-Speech Tagger Based on Morphological Analysis
This paper describes a method based on morphological analysis of words for a Persian Part-Of-Speech (POS) tagging system. This is a main part of a process for expanding a large Pe...
Mahdi Mohseni, Behrouz Minaei-Bidgoli