Results 211 to 220 of about 499,671 (260)

Directly comparing randomized and real-world controls in adjuvant breast cancer. [PDF]

open access: yesJ Comp Eff Res
Walker B   +6 more
europepmc   +1 more source

Analysis of Matched Samples

Infection Control & Hospital Epidemiology, 1989
Introduction in order to study the association between disease status (eg, nosocomial infection) and some exposure variable (eg, number of days on urinary catheter), it is often necessary to take into account other variables that may influence either the disease status or the exposure variable.
R F, Woolson, L A, McNutt
openaire   +2 more sources

Matching samples of multiple views

Data Mining and Knowledge Discovery, 2010
Multi-view learning studies how several views, different feature representations, of the same objects could be best utilized in learning. In other words, multi-view learning is analysis of co-occurrence data, where the observations are co-occurrences of samples in the views.
Abhishek Tripathi   +3 more
openaire   +1 more source

Voice recognition by matching to sample

Journal of Psycholinguistic Research, 1972
Voice recognition was assessed by a matching to sample procedure in 30 right-handed adults with normal hearing. The subject was required to indicate which of three voices speaking a nonsense syllable matched the speaker of a sample vowel. Subjects were able to recognize voices with reasonable accuracy, but there were no significant differences as a ...
D G, Doehring, R W, Ross
openaire   +2 more sources

On Optimal Matching of Gaussian Samples

Journal of Mathematical Sciences, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Approximate pattern matching with samples

1994
We simplify in this paper the algorithm by Chang and Lawler for the approximate string matching problem, by adopting the concept of sampling. We have a more general analysis of expected time with the simplified algorithm for the one-dimensional case under a non-uniform probability distribution, and we show that our method can easily be generalized to ...
openaire   +1 more source

Matchings, Random Walks, and Sampling

2014
The maximum matching problem is among the most well-studied problems in combinatorial optimization with many applications. The matching problem is well-known to be efficiently solvable, that is, there are algorithms that solve the matching problem using polynomial space and time.
openaire   +1 more source

On Matching Lists by Samples

Journal of the American Statistical Association, 1961
Abstract The problem considered is estimation by sampling methods of the number of names common to two or more lists. The situation covered is that in which the lists are found to have been merged and must be sampled as one. A comparison is made with the case in which the lists can be sampled separately.
openaire   +1 more source

Home - About - Disclaimer - Privacy