Solving Finite Mixture Models: Efficient Computation in Economics Under Serial and Parallel Execution
نویسندگان
چکیده
منابع مشابه
Geodesic Finite Mixture Models
The use of Riemannian manifolds and their statistics has recently gained popularity in a wide range of applications involving non-linear data modeling. For instance, they have been used to model shape changes in the brain [1] and human motion [3]. In this work we tackle the problem of approximating the Probability Density Function (PDF) of a potentially large dataset that lies on a known Rieman...
متن کاملComputation-Efficient Parallel Prefix
We are interested in solving the prefix problem of n inputs using p < n processors on completely connected distributed-memory multicomputers (CCDMMs). This paper improves a previous work in three respects. First, the communication time of the previous algorithm is reduced significantly. Second, we show that p(p + 1)/2 < n is required for the new algorithm and the original one to be applicable. ...
متن کاملEfficient and highly parallel computation
There are many variations of the basic parallel random access machine (PRAM), which includes an arbitrary number of processors sharing an arbitrary amount of random access memory. An exclusive-read, exclusive-write PRAM (EREW PRAM) does not allow any concurrent memory accesses (so all concurrent memory accesses must be explicitly serialized in the program). An EREW PRAM is useful because any al...
متن کامل6.895 Final Project: Serial and Parallel execution of Funnel Sort
The speed of a sorting algorithm is often measured based on the sheer number of calculations required to sort an n element array. However, in practice the sheer number of calcualtions is not the only factor in determining the running time of the sorting algorithm. For the purposes of the paper, we analyze the affect of cache/main memory memory transfers on the “Wall-clock running time” of a sor...
متن کاملEfficient Parallel And Serial Approximate String Matching
Consider the string matching problem, where differences between characters of the pattern and characters of the text are allowed. Each difference is due to either a mismatch between a character of the text and a character of the pattern or a superfluous character in the text or a superfluous character in the pattern. Given a text of length n, a pattern of length m and an integer k, we present p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Economics
سال: 2005
ISSN: 0927-7099,1572-9974
DOI: 10.1007/s10614-005-6413-3