More Like this

1. The impact of cold electrons and cold ions in magnetospheric physics

   https://doi.org/10.1016/j.jastp.2021.105599  

   Delzanno, Gian Luca; Borovsky, Joseph E.; Henderson, Michael G.; Resendiz Lira, Pedro Alberto; Roytershteyn, Vadim; Welling, Daniel T. (September 2021, Journal of Atmospheric and Solar-Terrestrial Physics)

   null (Ed.)
2. Gravitational waves in cold dark matter

   https://doi.org/10.1103/PhysRevD.97.123506  

   Flauger, Raphael; Weinberg, Steven (June 2018, Physical Review D)
3. Iodine quantification in limited angle tomography

   https://doi.org/10.1002/mp.14400  

   Michielsen, Koen; Rodríguez‐Ruiz, Alejandro; Reiser, Ingrid; Nagy, James G.; Sechopoulos, Ioannis (October 2020, Medical Physics)

   null (Ed.)
4. Limited Lookahead in Imperfect-Information Games

   https://doi.org/10.1016/j.artint.2019.103218  

   Kroer, C.; Sandholm, T. (June 2020, Artificial intelligence)
5. Approximate Nearest Neighbors in Limited Space

   https://doi.org/10.1137/1.9781611975031  

   Indyk, Piotr; Wagner, Tal (January 2018, Conference on Learning Theory)

   We consider the (1+ϵ)-approximate nearest neighbor search problem: given a set X of n points in a d-dimensional space, build a data structure that, given any query point y, finds a point x∈X whose distance to y is at most (1+ϵ)minx∈X ‖x−y‖ for an accuracy parameter ϵ∈(0,1). Our main result is a data structure that occupies only O(ϵ^−2 n log(n)log(1/ϵ)) bits of space, assuming all point coordinates are integers in the range {−n^O(1)…n^O(1)}, i.e., the coordinates have O(logn) bits of precision. This improves over the best previously known space bound of O(ϵ^−2 n log(n)^2), obtained via the randomized dimensionality reduction method of Johnson and Lindenstrauss (1984). We also consider the more general problem of estimating all distances from a collection of query points to all data points X, and provide almost tight upper and lower bounds for the space complexity of this problem. 

   more » « less