Sciweavers

2883 search results - page 279 / 577
» Algorithms for merged indexes
Sort
View
VLDB
2004
ACM
98views Database» more  VLDB 2004»
15 years 11 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 10 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
15 years 9 months ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
15 years 7 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 6 months ago
ML(n)BiCGStab: Reformulation, Analysis and Implementation
With the help of index functions, we re-derive the ML(n)BiCGStab algorithm in [35] in a more systematic way. There are n ways to define the ML(n)BiCGStab residual vector. Each diff...
Man-Chung Yeung