TPA: A New Method for Approximate Counting

dc.contributor.advisor

Huber, Mark

dc.contributor.author

Schott, Sarah

dc.date.accessioned

2012-05-25T20:09:03Z

dc.date.available

2012-05-25T20:09:03Z

dc.date.issued

2012

dc.department

Mathematics

dc.description.abstract

Many high dimensional integrals can be reduced to the problem of finding the relative measure of two sets. Often one set will be exponentially larger than the other. A standard method of dealing with this problem is to interpolate between the sets with a series of nested sets where neighboring nested sets have relative measures bounded above by a constant. Choosing these sets can be very difficult in practice. Here a new approach that creates a randomly drawn sequence of such sets is presented. This procedure gives faster approximation algorithms and a well-balanced set of nested sets that are essential to building effective tempering and annealing algorithms.

dc.identifier.uri

https://hdl.handle.net/10161/5429

dc.subject

Mathematics

dc.title

TPA: A New Method for Approximate Counting

dc.type

Dissertation

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Schott_duke_0066D_11274.pdf
Size:
1.45 MB
Format:
Adobe Portable Document Format

Collections