Sciweavers

3238 search results - page 336 / 648
» Not Enough Points Is Enough
Sort
View
AIRS
2005
Springer
16 years 9 days ago
Query Expansion with the Minimum Relevance Judgments
Query expansion techniques generally select new query terms from a set of top ranked documents. Although a user’s manual judgment of those documents would much help to select goo...
Masayuki Okabe, Kyoji Umemura, Seiji Yamada
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
16 years 9 days ago
A Lower Bound on List Size for List Decoding
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...
Venkatesan Guruswami, Salil P. Vadhan
CALCO
2005
Springer
119views Mathematics» more  CALCO 2005»
16 years 9 days ago
The Category Theoretic Solution of Recursive Program Schemes
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoret...
Stefan Milius, Lawrence S. Moss
CIARP
2005
Springer
16 years 9 days ago
Surface Grading Using Soft Colour-Texture Descriptors
Abstract. This paper presents a new approach to the question of surface grading based on soft colour-texture descriptors and well known classifiers. These descriptors come from gl...
Fernando López, José Miguel Valiente...
CIE
2005
Springer
16 years 9 days ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui