Algorithms for projecting points to give the most uniform distribution with applications to hashing (Q2366237): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01190156 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020587459 / rank | |||
Normal rank | |||
Latest revision as of 11:14, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for projecting points to give the most uniform distribution with applications to hashing |
scientific article |
Statements
Algorithms for projecting points to give the most uniform distribution with applications to hashing (English)
0 references
29 June 1993
0 references
computational geometry
0 references
duality transform
0 references
hashing
0 references
intersection- reporting algorithm
0 references
linear-space algorithm
0 references
plane sweep
0 references
projection
0 references
simplex range search
0 references
topological walk
0 references
