Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Ruth Silverman"'
Autor:
Fiona Aiton, Ruth Silverman
Publikováno v:
Prevention, Recognition and Management of Fetal Alcohol Spectrum Disorders ISBN: 9783030739652
We know that sleep problems affect 20–30% of all children during childhood and that disturbed or poor sleep affects many aspects of daytime functioning. Poor sleep is known to affect memory consolidation, cognitive function, academic achievement, d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ac7c77dd95f1625a0546b5d2ba82556
https://doi.org/10.1007/978-3-030-73966-9_23
https://doi.org/10.1007/978-3-030-73966-9_23
Publikováno v:
Computational Statistics & Data Analysis. 99:148-170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eadfa91540d2affdbb9ade7d816d806e
https://doi.org/10.1016/j.csda.2016.01.016
https://doi.org/10.1016/j.csda.2016.01.016
Publikováno v:
Algorithmica. 69:148-183
The linear least trimmed squares (LTS) estimator is a statistical technique for fitting a linear model to a set of points. Given a set of n points in ℝ d and given an integer trimming parameter h≤n, LTS involves computing the (d−1)-dimensional
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48449f77a662d5c05a50ac95d9a483b7
https://doi.org/10.1007/s00453-012-9721-8
https://doi.org/10.1007/s00453-012-9721-8
Publikováno v:
Computational Statistics & Data Analysis. 51:2461-2486
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because of their lack of sensitivity to outlying data points. The least median-o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58376e292b355fdd349740e7d616e1a5
https://doi.org/10.1016/j.csda.2006.08.033
https://doi.org/10.1016/j.csda.2006.08.033
Autor:
Tapas Kanungo, Nathan S. Netanyahu, David M. Mount, Ruth Silverman, Christine D. Piatko, Angela Y. Wu
Publikováno v:
Symposium on Computational Geometry
In k-means clustering we are given a set of n data points in d-dimensional space Rd and an integer k, and the problem is to determine a set of k points in Rd, called centers, to minimize the mean squared distance from each data point to its nearest c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cdb7b38a735128b32dbb55e87bae7f0a
Autor:
Angela Y. Wu, David M. Mount, Tapas Kanungo, Ruth Silverman, Nathan S. Netanyahu, Christine D. Piatko
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 24:881-892
In k-means clustering, we are given a set of n data points in d-dimensional space R/sup d/ and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1987c7d32d62189d23c05e15397cd03a
https://doi.org/10.1109/tpami.2002.1017616
https://doi.org/10.1109/tpami.2002.1017616
Autor:
David M. Mount, Tapas Kanungo, Nathan S. Netanyahu, Angela Y. Wu, Ruth Silverman, Christine D. Piatko
Publikováno v:
IEEE Transactions on Image Processing. 10:1826-1835
Computing discrete two-dimensional (2-D) convolutions is an important problem in image processing. In mathematical morphology, an important variant is that of computing binary convolutions, where the kernel of the convolution is a 0-1 valued function
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d58e61f824f629d81061ee8e3350ba1b
https://doi.org/10.1109/83.974567
https://doi.org/10.1109/83.974567
Publikováno v:
Computational Geometry. 17:97-119
The nearest neighbor problem is that of preprocessing a set P of n data points in Rd so that, given any query point q, the closest point in P to q can be determined efficiently. In the chromatic nearest neighbor problem, each point of P is assigned a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d30d09b8585176d024dc4f1b8d435d9
https://doi.org/10.1016/s0925-7721(00)00021-3
https://doi.org/10.1016/s0925-7721(00)00021-3
Publikováno v:
International Journal of Computational Geometry & Applications. 10:593-608
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-known instances of this problem include finding the smallest enclosing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::caade99645c664bc50579a222fa50121
https://doi.org/10.1142/s0218195900000334
https://doi.org/10.1142/s0218195900000334
Publikováno v:
Journal of the ACM. 45:891-923
Consider a set of S of n data points in real d -dimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching, we preprocess S into a data structure, so that given any query point q ∈ R d , is the c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4514917280ea9a927dec6be0bd4a0908
https://doi.org/10.1145/293347.293348
https://doi.org/10.1145/293347.293348