TPA: A New Method for Approximate Counting
نویسندگان
چکیده
TPA: A New Method for Approximate Counting by Sarah Schott Department of Mathematics Duke University
منابع مشابه
a New Approximate Solution Technique (Quantized Method) for Simultaneous Gas Solid Reactions
Simultaneous reactions between solids and gases are very important in the chemical and metallurgical processes. In the modeling, the chemical reaction and diffusion of gases must be considered. Therefore, a set of coupled partial differential equations is found. When the kinetic is a function of solid concentration, there is not any analytical solution for these equations. Therefore, numerical ...
متن کاملApproximate Counting via the Poisson-Laplace-Mellin Method
Approximate counting is an algorithm that provides a count of a huge number of objects within an error tolerance. The first detailed analysis of this algorithm was given by Flajolet. In this paper, we propose a new analysis via the Poisson-Laplace-Mellin approach, a method devised for analyzing shape parameters of digital search trees in a recent paper of Hwang et al. Our approach yields a diff...
متن کاملVehicle Interior Vibration Simulation-a Tool for Engine Mount Optimization
By new advancements in vehicle manufacturing vehicle quality evaluation and assurance has become a more critical issue. In present work, the vibration transfer path analysis and vibration path ranking of a car interior has been performed. The method is similar to classical multilevel TPA methods but has distinct differences. The method is named VIVS which stands for Vehicle Interior Vibratio...
متن کاملTPA: Two Phase Approximation for Random Walk with Restart
Given a large graph, how can we determine similarity between nodes in a fast and accurate way? Random walk with restart (RWR) is a popular measure for this purpose and has been exploited in numerous data mining applications including ranking, anomaly detection, link prediction, and community detection. However, previous methods for computing exact RWR require prohibitive storage sizes and compu...
متن کاملApproximate Counting Scheme for m X n Contingency Tables
In this paper, we propose a new counting scheme for m × n contingency tables. Our scheme is a modification of Dyer and Greenhill’s scheme for two rowed contingency tables [5]. We can estimate not only the sizes of error, but also the sizes of the bias of the number of tables obtained by our scheme, on the assumption that we have an approximate sampler. key words: counting, approximation, #P-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012