5105 search results - page 190 / 1021 » An algorithm to determine peer-reviewers |
161
click to vote
CLEF
2005
Springer
16 years 2 days ago
2005
Springer
We developed algorithmic stemmers for Hungarian and used them for the ad-hoc monolingual task for CLEF 2005. Our goal was to determine what degree of stemming is the most effectiv...
144
click to vote
ICALP
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
142
click to vote
CLEF
2000
Springer
15 years 11 months ago
2000
Springer
We employ Automorphology, an MDL-based algorithm that determines the suffixes present in a language-sample with no prior knowledge of the language in question, and describe our exp...
158
click to vote
GM
1999
Springer
15 years 10 months ago
1999
Springer
This paper is concerned with various aspects of the modeling of parallel curves on surfaces with special emphasis on surfaces of revolution. An algorithm for efficient tracking of...
211
click to vote
DFG
1992
Springer
15 years 10 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...