Data Structures, Near Neighbor Searches, and Methodology最新文献

筛选
英文 中文
Experimental evaluation of disk-based data structures for nearest neighbor searching 基于磁盘的最近邻搜索数据结构的实验评价
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/05
Norio Katayama, S. Satoh
{"title":"Experimental evaluation of disk-based data structures for nearest neighbor searching","authors":"Norio Katayama, S. Satoh","doi":"10.1090/dimacs/059/05","DOIUrl":"https://doi.org/10.1090/dimacs/059/05","url":null,"abstract":"","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122999340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Nearest neighbor search for data compression 数据压缩的最近邻搜索
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/04
K. Zatloukal, M. H. Johnson, R. Ladner
{"title":"Nearest neighbor search for data compression","authors":"K. Zatloukal, M. H. Johnson, R. Ladner","doi":"10.1090/dimacs/059/04","DOIUrl":"https://doi.org/10.1090/dimacs/059/04","url":null,"abstract":"","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114280048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Partially persistent dynamic sets for history-sensitive heuristics 用于历史敏感启发式的部分持久动态集
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/01
R. Battiti
{"title":"Partially persistent dynamic sets for history-sensitive heuristics","authors":"R. Battiti","doi":"10.1090/dimacs/059/01","DOIUrl":"https://doi.org/10.1090/dimacs/059/01","url":null,"abstract":"EEectiveheuristic algorithmsfor combinatorialproblemsare based on integrating local neighborhood search with history-sensitive schemes, where the information collected during the previous search phase is used to direct the future eeort. In particular, some algorithms (like Strict Tabu Search and Reactive Tabu Search) need to detect whether a connguration has already been encountered during the previous phase of the search, either to prohibit repetitions or to determine a prohibition parameter in an adaptive way. This paper analyzes the use of persistent dynamic sets for storing and retrieving states and discusses the advantages of this option with respect to popular but less eecient realizations. If the search space is given by L-bit binary strings, the method complexity is O(L) average-case time per search iteration when hashing is used, while the total space for a sequence of t iterations is O(t). A concrete realization of the abstract data type through a C++ class is presented. The obtained memory occupation and timing results are analyzed for selected dictionary\" benchmark tasks and for the use of the structure to support history{sensitive heuristic algorithms, in particular for the Maximum Clique problem in graphs.","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130802756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Computational evaluation of hot queues 热队列的计算评估
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/03
A. Goldberg, Craig Silverstein
{"title":"Computational evaluation of hot queues","authors":"A. Goldberg, Craig Silverstein","doi":"10.1090/dimacs/059/03","DOIUrl":"https://doi.org/10.1090/dimacs/059/03","url":null,"abstract":"The heap-on-top (hot) priority queue data structure 6] improves on the best known times for Dijkstra's shortest path algorithm. It also has very good practical performance and is robust over a wide range of graph types. The heart of Dijkstra's algorithm is a monotone priority queue, that is, a priority queue where no element on the queue ever becomes smaller than the most recently extracted element. In this paper, we show that the hot queue implementation of monotone priority queues is competitive in a more general context.","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115592997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
The role of experiment in the theory of algorithms 实验在算法理论中的作用
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/09
Richard J. Anderson
{"title":"The role of experiment in the theory of algorithms","authors":"Richard J. Anderson","doi":"10.1090/dimacs/059/09","DOIUrl":"https://doi.org/10.1090/dimacs/059/09","url":null,"abstract":"","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115472658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Approximate nearest neighbor search using the extended general space-filling curves heuristic 利用扩展的一般空间填充曲线启发式逼近最近邻搜索
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/07
J. Pérez-Cortes, E. Vidal
{"title":"Approximate nearest neighbor search using the extended general space-filling curves heuristic","authors":"J. Pérez-Cortes, E. Vidal","doi":"10.1090/dimacs/059/07","DOIUrl":"https://doi.org/10.1090/dimacs/059/07","url":null,"abstract":"","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130984240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A bibliography of algorithm experimentation 算法实验参考书目
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/12
Catherine C. McGeoch
{"title":"A bibliography of algorithm experimentation","authors":"Catherine C. McGeoch","doi":"10.1090/dimacs/059/12","DOIUrl":"https://doi.org/10.1090/dimacs/059/12","url":null,"abstract":"Preliminary Draft. This annotated bibliography lists sources that address methodology, tools and techniques, and standards for experimental research on algorithms. I've tried, in the annotation, to summarize the content and the target audience. No attempt has been made to catalog the huge number of published examples of experimental and computational research on algorithms, although some general publication venues are listed. We begin with a shortlist of resources for the beginning experimentor. These sources, taken together, provide good overall coverage of the main issues of experimental research, at about the level of a rst-year graduate student in computer science. The larger reference list that follows contains works on more specialized, advanced, and technical topics. Bentley Ben91] shows how to build a Unix environment that supports eecient testing and data collection. Ahuja, Magnanti, and Orlin AMO93] discuss algorithmic performance measures that closely predict running times and that (to some extent) can be extrapolated across machine environments. Cohen Coh95] presents basic statistical concepts with many examples from experimental research on algorithms. For a good introduction to techniques of graphical data analysis, see Chambers et al. CCKT83]. Crowder, Dembo, Mulvey CDM78], and the follow-up article by Jackson et al. JBNP91] give criteria and standards for presentation of experimental research in published work. The rst 1","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125952285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A theoretician's guide to the experimental analysis of algorithms 算法实验分析的理论指南
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/11
David S. Johnson
{"title":"A theoretician's guide to the experimental analysis of algorithms","authors":"David S. Johnson","doi":"10.1090/dimacs/059/11","DOIUrl":"https://doi.org/10.1090/dimacs/059/11","url":null,"abstract":"This paper presents an informal discussion of issues that arise when one attempts to analyze algorithms experimentally. It is based on lessons learned by the author over the course of more than a decade of experimentation, survey paper writing, refereeing, and lively discussions with other experimentalists. Although written from the perspective of a theoretical computer scientist, it is intended to be of use to researchers from all fields who want to study algorithms experimentally. It has two goals: first, to provide a useful guide to new experimentalists about how such work can best be performed and written up, and second, to challenge current researchers to think about whether their own work might be improved from a scientific point of view. With the latter purpose in mind, the author hopes that at least a few of his recommendations will be considered controversial.","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127767994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 331
A practical perfect hashing algorithm 一个实用的完美哈希算法
Data Structures, Near Neighbor Searches, and Methodology Pub Date : 1900-01-01 DOI: 10.1090/dimacs/059/02
Craig Silverstein
{"title":"A practical perfect hashing algorithm","authors":"Craig Silverstein","doi":"10.1090/dimacs/059/02","DOIUrl":"https://doi.org/10.1090/dimacs/059/02","url":null,"abstract":"Hashing is a fundamental technique in Computer Science, and perfect hashing, which guarantees constant-time lookup, has particular theoretical and practical importance. The algorithm of Fredman, Komll os, and Szemer edi 8], augmented by Dietzfelbinger, et al. 7], is a simple perfect hashing scheme that has not seen extensive use due to poor practical performance. In this paper, we develop modiications to the previous techniques that result in a fast, space-eecient algorithm. We show the resulting algorithm is comparable to hash algorithms used in several popular dictionary libraries but is more exible and has better theoretical performance.","PeriodicalId":370446,"journal":{"name":"Data Structures, Near Neighbor Searches, and Methodology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129737107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书