Sciweavers

727 search results - page 10 / 146
» Two thresholds are better than one
Sort
View
IPM
2007
113views more  IPM 2007»
13 years 7 months ago
Two uses of anaphora resolution in summarization
We propose a new method for using anaphoric information in Latent Semantic Analysis (lsa), and discuss its application to develop an lsa-based summarizer which achieves a signifi...
Josef Steinberger, Massimo Poesio, Mijail Alexandr...
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
14 years 2 months ago
Semi-naive Exploitation of One-Dependence Estimators
—It is well known that the key of Bayesian classifier learning is to balance the two important issues, that is, the exploration of attribute dependencies in high orders for ensu...
Nan Li, Yang Yu, Zhi-Hua Zhou
ICIP
2006
IEEE
14 years 9 months ago
A Heuristic Binarization Algorithm for Documents with Complex Background
This paper proposes a new method for binarization of digital documents. The proposed approach performs binarization by using a heuristic algorithm with two different thresholds an...
George D. C. Cavalcanti, Eduardo F. A. Silva, Cleb...
ITICSE
2006
ACM
14 years 1 months ago
Gender gap in computer science does not exist in one former soviet republic: results of a study
It is well known that women’s involvement in the field of Computer Science is very low in the USA. This is viewed as a significant problem and has become a great concern to educ...
Hasmik Gharibyan, Stephan Gunsaulus
IPL
2007
105views more  IPL 2007»
13 years 7 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk