Sciweavers

6274 search results - page 46 / 1255
» From query complexity to computational complexity
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 4 months ago
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
Davide Schipani, Michele Elia, Joachim Rosenthal
CIKM
2010
Springer
13 years 8 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
ECIR
2010
Springer
13 years 11 months ago
Improving Retrievability of Patents in Prior-Art Search
Prior-art search is an important task in patent retrieval. The success of this task relies upon the selection of relevant search queries. Typically terms for prior-art queries are ...
Shariq Bashir, Andreas Rauber
ADC
1995
Springer
90views Database» more  ADC 1995»
14 years 1 months ago
Computer Supported Query Formulation in an Evolving Context
Even if high-level query languages are used, query formulation may cause problems. This is notably so in case of large and complex application domains. Typical examples of these k...
Arthur H. M. ter Hofstede, Henderik Alex Proper, T...
IJCIS
2007
85views more  IJCIS 2007»
13 years 9 months ago
Typing and Transformational Effects in Complex Information Supply
Information plays an increasingly important role in our lives. Often we retrieve this information by querying the Web: data resources found on the web may provide the information ...
Bas van Gils, Henderik Alex Proper, Patrick van Bo...