Sciweavers

180 search results - page 27 / 36
» Approximate Searching on Compressed Text
Sort
View
180
Voted
SIAMIS
2011
14 years 7 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
98
Voted
LREC
2010
165views Education» more  LREC 2010»
15 years 2 months ago
Improving Personal Name Search in the TIGR System
This paper describes the development and evaluation of enhancements to the specialized information retrieval capabilities of a multimodal reporting system. The system enables coll...
Keith J. Miller, Sarah McLeod, Elizabeth Schroeder...
ISPAN
1997
IEEE
15 years 4 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
CIKM
2008
Springer
15 years 2 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
101
Voted
DCC
2002
IEEE
16 years 6 days ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr