Sciweavers

4302 search results - page 804 / 861
» Index Pairs Algorithms
Sort
View
WWW
2001
ACM
14 years 9 months ago
Placing search in context: the concept revisited
We describe a new paradigm for performing search in context. In the IntelliZap system we developed, search is initiated from a text query marked by the user in a document she view...
Lev Finkelstein, Evgeniy Gabrilovich, Yossi Matias...
KDD
2009
ACM
140views Data Mining» more  KDD 2009»
14 years 9 months ago
Improving clustering stability with combinatorial MRFs
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
Ron Bekkerman, Martin Scholz, Krishnamurthy Viswan...
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
14 years 9 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»
14 years 9 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
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
14 years 9 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