10493 search results - page 1674 / 2099 » Dynamic Word Problems |
146
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
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...
142
Voted
VLSID
2001
IEEE
16 years 4 months ago
2001
IEEE
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...
132
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
157
Voted
ALT
2006
Springer
16 years 21 days ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
160
Voted
SC
2009
ACM
15 years 10 months ago
2009
ACM
MapReduce provides a parallel and scalable programming model for data-intensive business and scientific applications. MapReduce and its de facto open source project, called Hadoop...