Sentence examples for coarse ranking from inspiring English sources

These days, the best do dozens, a development not captured in 8a's coarse ranking.

This explanation is not convincing, since selecting a subset of fair allocations is formally equivalent to defining a full-blown albeit coarse ranking, with "good" and "bad" allocations.

Furthermore, based on coarse ranking of compound potency, hits can be followed up by cellular IC50 measurement using NMR spectroscopy, which can also be handled in an automated fashion.

The magazine American Architect saw ivy in an entirely different light, in 1907 bemoaning the "Japanese ivy leaves coarse and rank" growing all over the library at Columbia, hiding the architecture.

Elephant grass (Pennisetum purpureum) can grow abundantly in areas where the vegetation has been disturbed, providing good fodder for grazing animals when young but quickly becoming rank, coarse, and a refuge for insects.

This interactive strategy can improve the retrieval performance through re-ranking the above coarse results, where we design a new similarity measure and take the feedback into account.

According to the different mesh sizes of the eight-sieved tower, four qualitative ranks were identified: coarse particles (% ≥1.4 mm); medium particles (0.8 mm ≤% <1.4 mm); fine particles (0.4 mm ≤% <0.8 mm); and very fine particles VFP (% <0.4 mm).

Habitat conservation status was assessed as being 'unfavourable inadequate' (the middle rank out of three) with the coarse Atlas_layer, and as 'unfavourable bad' (the bottom rank out) when using the higher resolution Forest_layer and OBIA_layer.

With this caveat, our modelling framework enabled us to identify the main sets of drivers of invasion by an aggressive plant species at a coarse spatial scale, and then to rank the importance of individual predictors at a finer scale.

"Coarse, vulgar, scurrilous, without any claim to rank as poetry," was the opinion of a Jesuit critic in The Irish Monthly in March 1913.

This method works with the ranked data π(f), and the bound is calculated by dividing the address of the rank permutation into two parts: a coarse address (a block) and a fine address (the permutation within the block).