Sciweavers

3818 search results - page 49 / 764
» Word Problems on Compressed Words
Sort
View
ERCIMDL
2005
Springer
114views Education» more  ERCIMDL 2005»
15 years 9 months ago
Compressing Dynamic Text Collections via Phrase-Based Coding
We present a new statistical compression method, which we call Phrase Based Dense Code (PBDC), aimed at compressing large digital libraries. PBDC compresses the text collection to ...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
ICTAI
2007
IEEE
15 years 10 months ago
Automatic Personalized Spam Filtering through Significant Word Modeling
Typically, spam filters are built on the assumption that the characteristics of e-mails in the training set is identical to those in individual users’ inboxes on which it will b...
Khurum Nazir Junejo, Asim Karim
EMNLP
2008
15 years 5 months ago
Scalable Language Processing Algorithms for the Masses: A Case Study in Computing Word Co-occurrence Matrices with MapReduce
This paper explores the challenge of scaling up language processing algorithms to increasingly large datasets. While cluster computing has been available in commercial environment...
Jimmy J. Lin
JAC
2008
15 years 5 months ago
Study of the NP-completeness of the compact table problem
The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This probl...
Jean-Christophe Dubacq, Jean-Yves Moyen
ITC
2003
IEEE
222views Hardware» more  ITC 2003»
15 years 9 months ago
Race: A Word-Level ATPG-Based Constraints Solver System For Smart Random Simulation
Functional verification of complex designs largely relies on the use of simulation in conjunction high-level verification languages (HVL) and test-bench automation (TBA) tools. In...
Mahesh A. Iyer