Research map / Detection and segmentation / CNN features
Revisiting Immediate Duplicate Detection in External Memory Search
Shunji Lin, Alex Fukunaga
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace compression with segmented compression p=10 (ablation) | A*-IDD · IPC barman-opt11/pfile02-005 | search time (s): 54440 -> 20466 | Improved |
| replace compression with segmented compression p=100 (ablation) | A*-IDD · IPC barman-opt11/pfile02-005 | search time (s): 54440 -> 17373 | Improved |
| increase partitions from p=100 to p=1000 (ablation) | segmented compression · IPC benchmark | average search time | Hurt |
| segmented compression instead of compression (ablation) | A*-IDD · 34 IPC instances, 48 h limit | instances solved: 27 -> 33 | Improved |
| segmented compression p=10 instead of compression (ablation) | A*-IDD · 34 IPC instances | instances solved: 27 -> 31 | Improved |
| segmented compression instead of compression on easy instances (ablation) | A*-IDD · easier IPC instances | search time | No clear effect |
| segmented compression partitions p=10,100,1000 (ablation) | A*-IDD · IPC false positive probes | factor of reduction (median): 10.3, 107.3, 1173.8 | Improved |
| use A*-IDD instead of A*-DDD | search algorithm · 15-puzzle | total time: 3.0 h -> 17.6 h | Hurt |
| use A*-IDD instead of External A* | search algorithm · 15-puzzle | total time: 3.8 h -> 17.6 h | Hurt |
| use A*-IDD instead of A*-DDD | search algorithm · IPC unit cost, hard instances | search time (s): 6756 -> 6552 | Improved |
| use A*-IDD instead of A*-DDD | search algorithm · IPC non-unit cost transport-opt14/p08 | search time (s): 14309 -> 5354 | Improved |
| use A*-IDD instead of External A* | search algorithm · IPC unit cost | instances solved: 3 -> 6 | Improved |
Closest papers by meaning
- PEA*+IDA*: An Improved Hybrid Memory-Restricted Algorithm (AAAI 2022 · similarity 0.84)
- An Imitation Learning Approach for Cache Replacement (ICML 2020 · similarity 0.82)
- SPANN: Highly-efficient Billion-scale Approximate Nearest Neighborhood Search (NeurIPS 2021 · similarity 0.81)
- Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search (AAAI 2025 · similarity 0.80)
- MiniPIC: Flexible Position-Independent Caching in <100LOC (NeurIPS 2026 · similarity 0.79)
- MEMAUDIT: An Exact Package-Oracle Evaluation Protocol for Budgeted Long-Term LLM Memory Writing (NeurIPS 2026 · similarity 0.78)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
