10.9k citations
- SLAC National Accelerator LaboratoryUS312 papers
- Kavli Institute for Particle Astrophysics and CosmologyUS226 papers
- Stanford Synchrotron Radiation LightsourceUS126 papers
- Centre National de la Recherche ScientifiqueFR122 papers
- California Institute of TechnologyUS118 papers
- University of California, BerkeleyUS116 papers
- University of California, Santa CruzUS113 papers
- Massachusetts Institute of TechnologyUS112 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR99 papers
- Lawrence Berkeley National LaboratoryUS99 papers
- University of Maryland, College ParkUS95 papers
- CEA Paris-SaclayFR91 papers
121 papers · 1 filter
Dynamic Bowtie for Fan-beam CT
Fenglin Liu, Ge Wang, Wenxiang Cong +2
A bowtie is a filter used to shape an x-ray beam and equalize its flux reaching different detector channels. For development of spectral CT with energy-discriminative photon-counti…
Exact Weight Subgraphs and the k-Sum Conjecture
Amir Abboud, Kevin Lewi
We consider the Exact-Weight-H problem of finding a (not necessarily induced) subgraph H of weight 0 in an edge-weighted graph G. We show that for every H, the complexity of this p…
Improved Capacity Approximations for Gaussian Relay Networks
Ritesh Kolte, Ayfer Özgür
Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forwar…
Exact and asymptotically robust permutation tests
EunYi Chung, Joseph P. Romano
Given independent samples from P and Q, two-sample permutation tests allow one to construct exact level tests when the null hypothesis is P=Q. On the other hand, when comparing or…
From Cookies to Cooks: Insights on Dietary Patterns via Analysis of Web Usage Logs
Robert West, Ryen W. White, Eric Horvitz
Nutrition is a key factor in people's overall health. Hence, understanding the nature and dynamics of population-wide dietary preferences over time and space can be valuable in pub…
How to Approximate A Set Without Knowing Its Size In Advance
Rasmus Pagh, Gil Segev, Udi Wieder
The dynamic approximate membership problem asks to represent a set S of size n, whose elements are provided in an on-line fashion, supporting membership queries without false negat…