SanakirjaSynonyymisanakirjaKääntäjäVastaukset

centroid

suomi-englanti sanakirja

centroid englannista suomeksi

  1. massan keskipiste

  1. Substantiivi

  2. painopiste

centroid englanniksi

  1. The point at which gravitational force (or other universally and uniformly acting force) may be supposed to act on a given rigid, uniformly dense body; the of gravity or of mass.

  2. {{quote-text|en|year=1892|author=Leander Miller Hoskins|title=The Elements of Graphic Statics|publisher=MacMillan and Co.|url=https://books.google.com.au/books?id=Px5LAAAAMAAJ&pg=PA152&dq=%22centroid%22%7C%22centroids%22&hl=en&newbks=1&newbks_redir=0&sa=X&ved=2ahUKEwiytoDOx-HtAhWjFzQIHbcACpIQ6AEwEHoECAIQAgv=onepage&q=%22centroid%22%7C%22centroids%22&f=false|pages=151–152

  3. {{quote-book|en|year=2004|author=Richard L. Francis; Timothy J. Lowe; Arie Tamir|chapter=7: Demand Point Aggregation for Local Models|editors=Zvi Drezner; Horst W. Hamacher|title=Facility Location: Applications and Theory|publisher=Springer-Verlag|pageurl=https://books.google.com.au/books?id=sxpcsGN7K1YC&pg=PA207&dq=%22centroid%22%7C%22centroids%22&hl=en&newbks=1&newbks_redir=0&sa=X&ved=2ahUKEwiytoDOx-HtAhWjFzQIHbcACpIQ6AEwKnoECD8QAgv=onepage&q=%22centroid%22%7C%22centroids%22&f=false|page=207

  4. 2020, Cheng Zhang, Qiuchi Li, Lingyu Hua, Dawei Song, ''Assessing the Memory Ability of Recurrent Neural Networks'', Giuseppe De Giacomo, ''et al.'' (editors), ''ECAI 2020: 24th European Conference on Artificial Intelligence'', (w), page 1660,

    5. In \mathbb R^n, a centroid is the mean position of all the points in all of the coordinate directions. The centroid of a subset \mathcal X of \mathbb R^n is computed as follows:
    : \operatorname{Centroid}(\mathcal X)=\frac{\int x g(x)dx}{\int g(x)dx}\quad\quad\quad\quad\quad\quad(6)
    where the integrals are taken over the whole space \mathbb R^n, and g is the characteristic function of the subset, which is 1 inside \mathcal X and 0 outside it 27.

  5. The point of intersection of the three medians of a given triangle; the point whose (Cartesian) coordinates are the mean of the coordinates of the three vertices.

  6. the point whose (Cartesian) coordinates are the mean of the coordinates of a given finite set of points.

  7. An analogue of the of gravity of a nonuniform body in which local density is replaced by a specified function (which can take negative values) and the place of the body's shape is taken by the function's domain.

  9. the mean (alternatively, median) position of a cluster of points in a coordinate system based on some application-dependent measure of distance.

  10. {{quote-book|en|year=2011|author=Ross Maciejewski|title=Data Representations, Transformations, and Statistics for Visual Reasoning|publisher=Morgan & Claypool Publishers|pageurl=https://books.google.com.au/books?id=V7hMYIrXZs4C&pg=PA34&dq=%22centroid%22%7C%22centroids%22+statistics&hl=en&newbks=1&newbks_redir=0&sa=X&ved=2ahUKEwj5kr3VnPrtAhUCcCsKHdKwDRoQ6AEwA3oECAYQAgv=onepage&q=%22centroid%22%7C%22centroids%22%20statistics&f=false|page=34

  11. {{quote-book|en|year=2012|author=Biswanath Panda; Joshua S. Herbach; Sugato Basu; Roberto J. Bayardo|chapter=2: MapReduce and its Application to Massively Parallel Learning of Decision Tree Ensembles|editors=Ron Bekkerman; Mikhail Bilenko; John Langford|title=Scaling Up Machine Learning|publisher=Cambridge University Press|pageurl=https://books.google.com.au/books?id=c5v5USMvcMYC&pg=PA26&dq=%22centroid%22%7C%22centroids%22+statistics&hl=en&newbks=1&newbks_redir=0&sa=X&ved=2ahUKEwj5kr3VnPrtAhUCcCsKHdKwDRoQ6AEwAHoECAEQAgv=onepage&q=%22centroid%22%7C%22centroids%22%20statistics&f=false|page=26

  12. Given a tree of ''n'' nodes, either (1) a unique node whose removal would split the tree into subtrees of fewer than ''n''/2 nodes, or (2) either of a pair of adjacent nodes such that removal of the edge connecting them would split the tree into two subtrees of exactly ''n''/2 nodes.

  13. 1974 Prentice-Hall, (w), ''Graph Theory with Applications to Engineering and Computer Science'', 2017, Dover, page 248,

    14. Just as in the case of centers of a tree (Section 3-4), it can be shown that every tree has either one centroid or two centroids. It can also be shown that if a tree has two centroids, the centroids are adjacent.

  14. 2009, Hao Yuan, Patrick Eugster, ''An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees'', Giuseppe Castagna (editor), ''Programming Languages and Systems: 18th European Symposium, Proceedings'', Springer, (w) 5502, page 186,

    15. A node x in a tree T is called a centroid of T if the removal of x will make the size of each remaining connected component no greater than \vert T \vert / 2. A tree may have at most two centroids, and if there are two then one must be a neighbor of the other 5. Throughout this paper, we specify the centroid to be the one whose numbering is lexicographically smaller (i.e, we number the nodes from 1 to n). There exists a linear time algorithm to compute the centroid of a tree due to the work of Goldman 21. We use \operatorname{CT}(T) to denote the centroid of T computed by the linear time algorithm.
Suomi Sanakirja   Tietoa palvelusta   Lähde: Wordnet Wiktionary (GFDL)   Eesti sõnaraamat