Results 151 to 160 of about 49,362 (204)
Emerging research opportunities in global urban ecology
Frontiers of Biogeography, 2011 Frank A. La Sorte
doaj
The geographic consequences of climate change for migratory birds
Frontiers of Biogeography, 2009 Frank A. La Sorte
doaj
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The sorting techniques: a tutorial paper on card sorts, picture sorts and item sorts
Expert Systems, 1997Although sorting techniques (e.g. card sorts) are widely used in knowledge acquisition and requirements acquisition, they have received little formal attention compared to related techniques such as repertory grids and laddering. This paper briefly describes the main sorting techniques, then provides a detailed tutorial on one variety (repeated single ...
Gordon Rugg, Peter McGeorge
openaire +1 more source
Fundamenta Informaticae, 2006
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case.
Joachim Giesen +2 more
openaire +2 more sources
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case.
Joachim Giesen +2 more
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1998
Summary: Sequence comparisons in computational molecular biology is a powerful tool for deriving evolutionary and functional relationships between genes. However, classical alignment algorithms handle only local mutations (i.e., insertions, deletions, and substitutions of nucleotides) and ignore global rearrangements (i.e., inversions and ...
Vineet Bafna, Pavel A. Pevzner
openaire +2 more sources
Summary: Sequence comparisons in computational molecular biology is a powerful tool for deriving evolutionary and functional relationships between genes. However, classical alignment algorithms handle only local mutations (i.e., insertions, deletions, and substitutions of nucleotides) and ignore global rearrangements (i.e., inversions and ...
Vineet Bafna, Pavel A. Pevzner
openaire +2 more sources
Accident and Emergency Nursing, 1997
Each year in Accident and Emergency an increasing number of young people present with acute problems related to social drugs. These problems range from mild symptoms to life-threatening conditions, many of which can be extremely difficult and time consuming for staff to manage.
openaire +2 more sources
Each year in Accident and Emergency an increasing number of young people present with acute problems related to social drugs. These problems range from mild symptoms to life-threatening conditions, many of which can be extremely difficult and time consuming for staff to manage.
openaire +2 more sources
Sorting, Approximate Sorting, and Searching in Rounds
SIAM Journal on Discrete Mathematics, 1988The worst case number of comparisons needed for sorting or selecting in rounds is considered. The following results are obtained. (a) For every fixed \(k\geq 2\), \(\Omega (n^{1+1/k}(\log n)^{1/k})\) comparisons are required to sort n elements in k rounds. \((O(n^{1+1/k}\log n)\) are known to be sufficient.) This improves the previously known bounds by
Noga Alon, Yossi Azar
openaire +2 more sources