✦ LIBER ✦

Estimates of Weil–Petersson Volumes¶via Effective Divisors

✍ Scribed by Georg Schumacher; Stefano Trapani

Publisher: Springer
Year: 2001
Tongue: English
Weight: 60 KB
Volume: 222
Category: Article
ISSN: 0010-3616
DOI: 10.1007/s002200100493

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weil-petersson volume of low-genus Modul

Weil-petersson volume of low-genus Moduli spaces

✍ P. G. Zograf 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 216 KB

Simple geodesics and Weil-Petersson volu

Simple geodesics and Weil-Petersson volumes of moduli spaces of bordered Riemann surfaces

✍ Maryam Mirzakhani 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 611 KB

An explicit upper bound for Weil-Peterss

An explicit upper bound for Weil-Petersson volumes of the moduli spaces of punctured Riemann surfaces

✍ Samuel Grushevsky 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 98 KB

On the Weil-Petersson Volume and the Fir

On the Weil-Petersson Volume and the First Chern Class of the Moduli Space of Calabi-Yau Manifolds

✍ Zhiqin Lu; Xiaofeng Sun 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 290 KB

The effect of volume sub-sampling on mot

The effect of volume sub-sampling on motion estimation of joints via MR imaging

✍ D. Sekaran 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 526 KB

The technique of three-dimensional imaging is being explored as a means of better understanding the morphology and kinematics of the foot and ankle. To capture information about the dynamic nature of the joint, MRI pulse sequences are used to rapidly acquire single-slice kinematic images, which are

Patch estimation via memory windows and

Patch estimation via memory windows and the effect of travel time

✍ Thomas J. Valone 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 439 KB

How a forager might use a memory window to estimate instantaneous harvest rate while it exploits slowly depleting patches in two different environments is considered here. The memory window represents some fraction of the total information obtained from sampling a patch and contains only the most re