Sciweavers

8311 search results - page 1302 / 1663
» Phase-Based Information Retrieval
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
VLDB
1998
ACM
91views Database» more  VLDB 1998»
15 years 11 months ago
Determining Text Databases to Search in the Internet
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
Weiyi Meng, King-Lup Liu, Clement T. Yu, Xiaodong ...
KDD
2010
ACM
190views Data Mining» more  KDD 2010»
15 years 10 months ago
User browsing models: relevance versus examination
There has been considerable work on user browsing models for search engine results, both organic and sponsored. The click-through rate (CTR) of a result is the product of the prob...
Ramakrishnan Srikant, Sugato Basu, Ni Wang, Daryl ...
ICAIL
2007
ACM
15 years 10 months ago
Essential deduplication functions for transactional databases in law firms
As massive document repositories and knowledge management systems continue to expand, in proprietary environments as well as on the Web, the need for duplicate detection becomes i...
Jack G. Conrad, Edward L. Raymond
CSMR
2004
IEEE
15 years 10 months ago
Supporting Architectural Restructuring by Analyzing Feature Models
In order to lower the risk, reengineering projects aim at high reuse rates. Therefore, tasks like architectural restructuring have to be performed in a way that developed new syst...
Ilian Pashov, Matthias Riebisch, Ilka Philippow
« Prev « First page 1302 / 1663 Last » Next »