Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@markhburton@mstdn.social
2024-06-09 08:39:36

But mainstream parties just want to boost demand for bome-ownership. So irrelevant and damaging.
Social rent homes in England fall by more than quarter of a million in decade | #SocialHousing

@arXiv_csDS_bot@mastoxiv.page
2024-04-30 07:20:27

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer
arxiv.org/abs/2404.18497 arxiv.org/pdf/2404.18497
arXiv:2404.18497v1 Announce Type: new
Abstract: A minimal perfect hash function (MPHF) maps a set of n keys to {1, ..., n} without collisions. Such functions find widespread application e.g. in bioinformatics and databases. In this paper we revisit PTHash - a construction technique particularly designed for fast queries. PTHash distributes the input keys into small buckets and, for each bucket, it searches for a hash function seed that places its keys in the output domain without collisions. The collection of all seeds is then stored in a compressed way. Since the first buckets are easier to place, buckets are considered in non-increasing order of size. Additionally, PTHash heuristically produces an imbalanced distribution of bucket sizes by distributing 60% of the keys into 30% of the buckets. Our main contribution is to characterize, up to lower order terms, an optimal distribution of expected bucket sizes. We arrive at a simple, closed form solution which improves construction throughput for space efficient configurations in practice. Our second contribution is a novel encoding scheme for the seeds. We split the keys into partitions. Within each partition, we run the bucket distribution and search step. We then store the seeds in an interleaved way by consecutively placing the seeds for the i-th buckets from all partitions. The seeds for the i-th bucket of each partition follow the same statistical distribution. This allows us to tune a compressor for each bucket. Hence, we call our technique PHOBIC - Perfect Hashing with Optimized Bucket sizes and Interleaved Coding. Compared to PTHash, PHOBIC is 0.17 bits/key more space efficient for same query time and construction throughput. We also contribute a GPU implementation to further accelerate MPHF construction. For a configuration with fast queries, PHOBIC-GPU can construct a perfect hash function at 2.17 bits/key in 28 ns per key, which can be queried in 37 ns on the CPU.

@arXiv_astrophHE_bot@mastoxiv.page
2024-05-30 07:00:00

Extended Shock Breakout and Early Circumstellar Interaction in SN 2024ggi
Manisha Shrestha, K. Azalee Bostroem, David J. Sand, Griffin Hosseinzadeh, Jennifer E. Andrews, Yize Dong, Emily Hoang, Daryl Janzen, Jeniveve Pearson, Jacob E. Jencson, M. J. Lundquist, Darshana Mehta, Aravind P. Ravi, Nicolas Meza Retamal, Stefano Valenti, Peter J. Brown, Saurabh W. Jha, Colin Macrie, Brian Hsu, Joseph Farah, D. Andrew Howell, Curtis McCully, Megan Newsome, Estefania Padilla Gonzalez, Craig Pel…