Sciweavers

4805 search results - page 777 / 961
» On the Analysis of Indexing Schemes
Sort
View
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 7 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
16 years 7 months ago
Email data cleaning
Addressed in this paper is the issue of `email data cleaning' for text mining. Many text mining applications need take emails as input. Email data is usually noisy and thus i...
Jie Tang, Hang Li, Yunbo Cao, ZhaoHui Tang
KDD
2004
ACM
163views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting dictionaries in named entity extraction: combining semi-Markov extraction processes and data integration methods
We consider the problem of improving named entity recognition (NER) systems by using external dictionaries--more specifically, the problem of extending state-of-the-art NER system...
William W. Cohen, Sunita Sarawagi
CHI
2008
ACM
16 years 7 months ago
An error model for pointing based on Fitts' law
For decades, Fitts' law (1954) has been used to model pointing time in user interfaces. As with any rapid motor act, faster pointing movements result in increased errors. But...
Jacob O. Wobbrock, Edward Cutrell, Susumu Harada, ...
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
16 years 7 months ago
An Efficient Parallel Transparent Bist Method For Multiple Embedded Memory Buffers
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
Der-Cheng Huang, Wen-Ben Jone, Sunil R. Das