Sciweavers

693 search results - page 31 / 139
» Finding Contradictions in Text
Sort
View
RSA
2006
91views more  RSA 2006»
13 years 10 months ago
Average case analysis of the Boyer-Moore algorithm
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
Tsung-Hsi Tsai
CSR
2006
Springer
14 years 2 months ago
Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
Patrick Cégielski, Irène Guessarian,...
IEICET
2006
116views more  IEICET 2006»
13 years 11 months ago
Extraction of Semantic Text Portion Related to Anchor Link
Recently, semantic text portion (STP) is getting popular in the field of Web mining. STP is a text portion in the original page which is semantically related to the anchor pointing...
Bui Quang Hung, Masanori Otsubo, Yoshinori Hijikat...
ICDM
2009
IEEE
176views Data Mining» more  ICDM 2009»
13 years 8 months ago
SISC: A Text Classification Approach Using Semi Supervised Subspace Clustering
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
Mohammad Salim Ahmed, Latifur Khan
ICML
2003
IEEE
14 years 11 months ago
Tackling the Poor Assumptions of Naive Bayes Text Classifiers
Naive Bayes is often used as a baseline in text classification because it is fast and easy to implement. Its severe assumptions make such efficiency possible but also adversely af...
Jason D. Rennie, Lawrence Shih, Jaime Teevan, Davi...