7.5k citations
- Massachusetts Institute of TechnologyUS55 papers
- University of California, BerkeleyUS51 papers
- Centre National de la Recherche ScientifiqueFR50 papers
- University of Maryland, College ParkUS50 papers
- Weizmann Institute of ScienceIL50 papers
- California Institute of TechnologyUS46 papers
- Princeton UniversityUS43 papers
- Heidelberg UniversityDE39 papers
- Université Paris CitéFR38 papers
- University of Massachusetts AmherstUS38 papers
- The Ohio State UniversityUS36 papers
- Technion – Israel Institute of TechnologyIL35 papers
113 papers · 1 filter
Progress in the Development of Plasma Panel Radiation Detectors
Robert Ball, James R. Beene, Yan Benhammou +13
Plasma Display Panels (PDP), the underlying engine of panel plasma television displays, are being investigated for their utility as radiation detectors called Plasma Panel Sensors…
Measurement of partial branching fractions of inclusive charmless B meson decays to K+, K0, and pi+
The BABAR Collaboration, P. del Amo Sanchez
We present measurements of partial branching fractions of , , and , where denotes any accessible final state abov…
Rotation Periods of Binary Asteroids with Large Separations - Confronting the Escaping Ejecta Binaries Model with Observations
D. Polishook, N. Brosch, D. Prialnik
Durda et al. (2004), using numerical models, suggested that binary asteroids with large separation, called Escaping Ejecta Binaries (EEBs), can be created by fragments ejected from…
The 2-Center Problem in Three Dimensions
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for comput…
Nonlocal PMD compensation in the transmission of non-stationary streams of polarization entangled photons
Mark Shtaif, Cristian Antonelli, Misha Brodsky
We study the feasibility of nonlocally compensating for polarization mode dispersion (PMD), when polarization entangled photons are distributed in fiber-optic channels.We quantify…
Improved distance queries in planar graphs
Yahav Nussbaum
There are several known data structures that answer distance queries between two arbitrary vertices in a planar graph. The tradeoff is among preprocessing time, storage space and q…