Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms (Q5458312): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-77004-6_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1869106409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Space/time trade-offs in hash coding with allowable errors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Min-wise independent permutations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Network Applications of Bloom Filters: A Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4250236 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Authoritative sources in a hyperlinked environment / rank | |||
Normal rank | |||
Latest revision as of 20:15, 27 June 2024
scientific article; zbMATH DE number 5262353
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms |
scientific article; zbMATH DE number 5262353 |
Statements
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms (English)
0 references
11 April 2008
0 references
