references.html

来自「SR-tree is an index structure for high-d」· HTML 代码 · 共 60 行

HTML
60 行
字号 
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">

<head>
<title>References</title>
</head>

<body bgcolor=white>

<h1>References</h1>

<hr>

<dl>
<dt><a name="WJ96-1">[WJ96-1]</a></dt>
<dd>
D. A. White and R. Jain,
``Similarity Indexing: Algorithms and Performance,''
Proc. SPIE Vol.2670, San Diego, USA (Jan. 1996) pp.62-73.
<p>
</dd>

<dt><a name="WJ96-2">[WJ96-2]</a></dt>
<dd>
D. A. White and R. Jain,
``Similarity Indexing with the SS-tree,''
Proc. of the 12th Int. Conf. on Data Engineering,
New Orleans, USA (Feb. 1996) pp.516-523.
<p>
</dd>

<dt><a name="KS97">[KS97]</a></dt>
<dd>
Norio Katayama and Shin'ichi Satoh,
``The SR-tree: An Index Structure for High-Dimensional
Nearest Neighbor Queries,''
Proc. of the 1997 ACM SIGMOD International Conference on
Management of Data (May 1997) pp.369-380.
<p>
</dd>

</dl>

<hr>
[<a href="index.html">TOC</a>]
[<a href="library.html">Library</a>]
[<a href="classes.html">Classes</a>]
[<a href="commands.html">Commands</a>]
[<a href="examples.html">Examples</a>]
[<a href="references.html">References</a>]

<p>
<i>Any feedback is appreciated (corrections, suggestions, etc.).</i>
</p>
<address>
Norio KATAYAMA
&lt;<a href="mailto:katayama@nii.ac.jp">katayama@nii.ac.jp</a>&gt;
</address>

</body>

references.html - 源码说明

本页面展示了「SR-tree is an index structure for high-dimensional nearest neighbor queries」中的 references.html 源码文件，采用 HTML 编程语言编写，共 60 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与high-dimensional相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?