180 search results - page 35 / 36 » Approximate Searching on Compressed Text |
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
FCCM
2011
IEEE
12 years 9 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
CPM
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
FOCS
2009
IEEE
13 years 9 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
SIGIR
2008
ACM
2008
ACM
Multi-document summarization via sentence-level semantic analysis and symmetric matrix factorization
13 years 5 months ago
Multi-document summarization aims to create a compressed summary while retaining the main characteristics of the original set of documents. Many approaches use statistics and mach...