✦ LIBER ✦

Approximate Halfspace Range Counting

✍ Scribed by Aronov, Boris; Sharir, Micha

Book ID: 118181068
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 313 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/080736600

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Approximate Range Counting and Depth

✍ Peyman Afshani; Timothy M. Chan 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 409 KB

Range Minima Queries with Respect to a R

Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting

✍ Haim Kaplan; Edgar Ramos; Micha Sharir 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 661 KB

Generalized approximate counting revisit

Generalized approximate counting revisited

✍ Guy Louchard; Helmut Prodinger 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 309 KB

Tight Lower Bounds for Halfspace Range S

Tight Lower Bounds for Halfspace Range Searching

✍ Sunil Arya; David M. Mount; Jian Xia 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 700 KB

Approximate counting: A detailed analysi

Approximate counting: A detailed analysis

✍ Philippe Flajolet 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 991 KB

Approximate counting via random optimiza

Approximate counting via random optimization

✍ Alexander Barvinok 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

Let F F be a family of subsets of 1, . . . , n . We propose a simple randomized n algorithm to estimate the cardinality of F F from the maximum weight of a subset X g F F in n n Ä 4 a random weighting of 1, . . . , n . The examples include enumeration of perfect matchings in graphs, bases in matroid