Výsledky vyhledávání - "Sylvia Halász"

The ngram chief complaint classifier: A novel method of automatically creating chief complaint classifiers based on international classification of diseases groupings

Autor: Philip Brown, Peter Milano, Colin Goodall, John R. Allegra, Dennis G. Cochrane, Sylvia Halász

Publikováno v: Journal of Biomedical Informatics. 43(2):268-272

Introduction: The ngram classifier is created by using text fragments to measure associations between chief complaints (CC) and a syndromic grouping of ICD-9-CM codes. Objectives: For gastrointestinal (GI) syndrome to determine: (1) ngram CC classifi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb46ce7c6b5398cbfa9b6e39a2821a70

Zobrazit plný text záznamu

Detecting the Start of the Flu Season

Autor: Arnold Lent, Colin Goodall, John R. Allegra, Philip Brown, Sylvia Halász, Dennis G. Cochrane

Publikováno v: Lecture Notes in Computer Science ISBN: 9783540726074
BioSurveillance

We have combined two methods to detect anomalies in a time series - in this case in emergency department visit data. The n-gram method applies an existing ICD classifier to a set of emergency department (ED) visits for which both the chief complaint

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d04590c578af8d9da81fc9e9199e3e12
https://doi.org/10.1007/978-3-540-72608-1_19

Zobrazit plný text záznamu

A Note on Random Triangles

Autor: Sylvia Halász, Daniel J. Kleitman

Publikováno v: Studies in Applied Mathematics. 53:225-237

In this paper we prove that the point in a triangle T maximizing the probability that it lies within a randomly chosen triangle within T is the center of T. A simple general closed expression for the indicated probability at any point P of T is obtai

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::039c795a31e8c077ad4f1cfbf3c54041
https://doi.org/10.1002/sapm1974533225

Zobrazit plný text záznamu

Packing a convex domain with similar convex domains

Autor: Sylvia Halász

Publikováno v: Journal of Combinatorial Theory, Series A. (1):85-90

Given a convex domain C and a positive integer k, inscribe k nonoverlapping convex domains into C, all of them similar to C. Denote by f(k) the maximal sum of their circumferences. In this paper it is shown, that for C square, parallelogram or triang

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4b6faebe254af8b46c4cd752d3f9146

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání