✦ LIBER ✦

On Approximate Range Counting and Depth

✍ Scribed by Peyman Afshani; Timothy M. Chan

Book ID: 106149951
Publisher: Springer
Year: 2009
Tongue: English
Weight: 409 KB
Volume: 42
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-009-9177-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate Halfspace Range Counting

✍ Aronov, Boris; Sharir, Micha 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 313 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

On counting and approximation

✍ Johannes Köbler; Uwe Schöning; Jacobo Toran 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 888 KB

Pseudorandomness for Approximate Countin

Pseudorandomness for Approximate Counting and Sampling

✍ Ronen Shaltiel; Christopher Umans 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 355 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

On Approximating the Depth and Related P

On Approximating the Depth and Related Problems

✍ Aronov, Boris; Har-Peled, Sariel 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 332 KB