October 11, 1842
نویسندگان
چکیده
منابع مشابه
11 October 2012
A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast tensor vector multiplication on a computer or dedicated hardware platform.
متن کاملLecture 11: October 4 11.1 Network Reliability
Consider a connected undirected graph G with n vertices and m edges, where each edge has some probability p of failing. What is the probability that G becomes disconnected under random, independent edge failures? This can also be viewed as a counting problem, except that each item now has an associated weight: in particular, we want to compute the sum of the weights of all disconnected subgraph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Zoological Society of London
سال: 1842
ISSN: 0370-2774
DOI: 10.1111/j.1469-7998.1842.tb00069.x