521 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Rutgers, The State University of New JerseyUS164 papers
- Fermi National Accelerator LaboratoryUS45 papers
- California Institute of TechnologyUS44 papers
- Carnegie Mellon UniversityUS37 papers
- University of California, Santa BarbaraUS37 papers
- University of ChicagoUS37 papers
- University of Minnesota SystemUS36 papers
- Centro de Investigaciones Energéticas, Medioambientales y TecnológicasES35 papers
- Unidades Centrales Científico-TécnicasES35 papers
- University of California, RiversideUS35 papers
- University of California, DavisUS34 papers
- Florida Department of StateUS33 papers
11 papers · 1 filter
Addressing Decadal Survey Science through Community Access to Highly Multiplexed Spectroscopy with BigBOSS on the KPNO Mayall Telescope
Caty Pilachowski, Carles Badenes, Stephen Bailey +87
This document summarizes the results of a community-based discussion of the potential science impact of the Mayall+BigBOSS highly multiplexed multi-object spectroscopic capability.…
Solving Linear System of Equations Via A Convex Hull Algorithm
Bahman Kalantari
We present new iterative algorithms for solving a square linear system in dimension by employing the {\it Triangle Algorithm} \cite{kal12}, a fully polynomial-time appro…
On Online Labeling with Polynomially Many Labels
Martin Babka, Jan Bulánek, Vladimír Čunát +2
In the online labeling problem with parameters n and m we are presented with a sequence of n keys from a totally ordered universe U and must assign each arriving key a label from t…
Don't Thrash: How to Cache Your Hash on Flash
Michael A. Bender, Martin Farach-Colton, Rob Johnson +7
This paper presents new alternatives to the well-known Bloom filter data structure. The Bloom filter, a compact data structure supporting set insertion and membership queries, has…
A Time and Space Efficient Algorithm for Contextual Linear Bandits
José Bento, Stratis Ioannidis, S. Muthukrishnan +1
We consider a multi-armed bandit problem where payoffs are a linear function of an observed stochastic contextual variable. In the scenario where there exists a gap between optimal…
Round-Robin Streaming with Generations
Yao Li, Péter Vingelmann, Morten Videbæk Pedersen +1
We consider three types of application layer coding for streaming over lossy links: random linear coding, systematic random linear coding, and structured coding. The file being str…
Probing the Interplay between Quantum Charge Fluctuations and Magnetic Ordering in LuFe2O4
J. Lee, S. A. Trugman, C. D. Batista +7
Ferroelectric and ferromagnetic materials possess spontaneous electric and magnetic order, respectively, which can be switched by the corresponding applied electric and magnetic fi…
A Characterization Theorem and An Algorithm for A Convex Hull Problem
Bahman Kalantari
Given and , testing if , the convex hull of , is a fundamental problem in computational geomet…
Saddlepoint approximations for likelihood ratio like statistics with applications to permutation tests
John Kolassa, John Robinson
We obtain two theorems extending the use of a saddlepoint approximation to multiparameter problems for likelihood ratio-like statistics which allow their use in permutation and ran…
Deviation optimal learning using greedy Q-aggregation
Dong Dai, Philippe Rigollet, Tong Zhang
Given a finite family of functions, the goal of model selection aggregation is to construct a procedure that mimics the function from this family that is the closest to an unknown…
Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization
Thomas L. Magnanti, Dan Stratila
We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-…