1422 search results - page 94 / 285 » Test Generation Algorithms Based on Preorder Relations |
165
click to vote
ICIP
1994
IEEE
16 years 7 months ago
1994
IEEE
In this work we present a new approach to two - dimensional robust spline smoothing. The proposed method is based on M-estimator algorithms but unlike in other M-estimator based i...
148
click to vote
CSB
2005
IEEE
15 years 12 months ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
162
click to vote
EUROPAR
2007
Springer
16 years 15 days ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
217
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approach...
142
click to vote
SPIRE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper examines a conflation method based on the N-grams approach and evaluates its performance relative to the results achieved by other techniques such as Porter a...