Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Magdeburg
Fak. für Informatik, Univ. Magdeburg
2002
|
Schriftenreihe: | Otto-von-Guericke-Universität, Fakultät für Informatik Preprint
2002,6 |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | IV, 36 S. graph. Darst. : 30 cm |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV014745680 | ||
003 | DE-604 | ||
005 | 20080402 | ||
007 | t | ||
008 | 020917s2002 gw d||| |||| 00||| eng d | ||
016 | 7 | |a 964964139 |2 DE-101 | |
035 | |a (OCoLC)76377071 | ||
035 | |a (DE-599)BVBBV014745680 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-19 | ||
100 | 1 | |a Balko, Sören |d 1974- |e Verfasser |0 (DE-588)12905299X |4 aut | |
245 | 1 | 0 | |a Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval |c Sören Balko ; Ingo Schmitt. [Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik] |
264 | 1 | |a Magdeburg |b Fak. für Informatik, Univ. Magdeburg |c 2002 | |
300 | |a IV, 36 S. |b graph. Darst. : 30 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Preprint / Otto-von-Guericke-Universität, Fakultät für Informatik |v 2002,6 | |
700 | 1 | |a Schmitt, Ingo |d 1966- |e Verfasser |0 (DE-588)120243989 |4 aut | |
800 | 1 | |a Otto-von-Guericke-Universität, Fakultät für Informatik |t Preprint |v 2002,6 |w (DE-604)BV009874748 |9 2002,6 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009988059&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009988059 |
Datensatz im Suchindex
_version_ | 1807772396877250560 |
---|---|
adam_text |
CONTENTS
LIST
OF
FIGURES
IV
1
INTRODUCTION
1
1.1
HIERARCHICAL
SIMPLEX
APPROXIMATION
.
1
1.2
RELATED
WORK
.
4
1.2.1
EXTERNAL
APPROACHES
.
4
1.2.2
OWN
WORK
.
6
2
TECHNICAL
FOUNDATIONS
7
2.1
RADIUS
AND
HEIGHT
OF
REGULAR
SIMPLEXES
.
7
2.2
SIMPLEX-TREE
.
10
2.2.1
DETERMINATION
OF
THE
ROOT
SIMPLEX
.
11
2.2.2
COMPUTATION
OF
VERTICE
POINTS
.
15
3
RETRIEVAL
17
3.1
RETRIEVAL
ALGORITHM
.
17
3.2
LOWERBOUND
AND
UPPERBOUND
.
18
3.2.1
FUNCTION
BOUNDARYSIMPLEXES
.
19
3.2.2
FUNCTION
INSIDEBOUNDARY
.
19
3.2.3
FUNCTION
CENTERPOINT
.
21
3.2.4
FUNCTION
PROJECTPOINT
.
22
4
MAINTENANCE
25
4.1
FIXED
HIERARCHY
DEPTH
.
25
II
CONTENTS
4.1.1
INSERTION
ALGORITHM
.
25
4.1.2
H
UFFMAN
ENCODING
.
27
4.2
VARIABLE
HIERARCHY
DEPTH
.
29
5
SUMMARY
33
BIBLIOGRAPHY
35 |
any_adam_object | 1 |
author | Balko, Sören 1974- Schmitt, Ingo 1966- |
author_GND | (DE-588)12905299X (DE-588)120243989 |
author_facet | Balko, Sören 1974- Schmitt, Ingo 1966- |
author_role | aut aut |
author_sort | Balko, Sören 1974- |
author_variant | s b sb i s is |
building | Verbundindex |
bvnumber | BV014745680 |
ctrlnum | (OCoLC)76377071 (DE-599)BVBBV014745680 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV014745680</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080402</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020917s2002 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">964964139</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)76377071</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014745680</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Balko, Sören</subfield><subfield code="d">1974-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12905299X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval</subfield><subfield code="c">Sören Balko ; Ingo Schmitt. [Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Magdeburg</subfield><subfield code="b">Fak. für Informatik, Univ. Magdeburg</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 36 S.</subfield><subfield code="b">graph. Darst. : 30 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Preprint / Otto-von-Guericke-Universität, Fakultät für Informatik</subfield><subfield code="v">2002,6</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schmitt, Ingo</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120243989</subfield><subfield code="4">aut</subfield></datafield><datafield tag="800" ind1="1" ind2=" "><subfield code="a">Otto-von-Guericke-Universität, Fakultät für Informatik</subfield><subfield code="t">Preprint</subfield><subfield code="v">2002,6</subfield><subfield code="w">(DE-604)BV009874748</subfield><subfield code="9">2002,6</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009988059&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009988059</subfield></datafield></record></collection> |
id | DE-604.BV014745680 |
illustrated | Illustrated |
indexdate | 2024-08-19T00:08:24Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009988059 |
oclc_num | 76377071 |
open_access_boolean | |
owner | DE-19 DE-BY-UBM |
owner_facet | DE-19 DE-BY-UBM |
physical | IV, 36 S. graph. Darst. : 30 cm |
publishDate | 2002 |
publishDateSearch | 2002 |
publishDateSort | 2002 |
publisher | Fak. für Informatik, Univ. Magdeburg |
record_format | marc |
series | Otto-von-Guericke-Universität, Fakultät für Informatik Preprint |
series2 | Preprint / Otto-von-Guericke-Universität, Fakultät für Informatik |
spelling | Balko, Sören 1974- Verfasser (DE-588)12905299X aut Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval Sören Balko ; Ingo Schmitt. [Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik] Magdeburg Fak. für Informatik, Univ. Magdeburg 2002 IV, 36 S. graph. Darst. : 30 cm txt rdacontent n rdamedia nc rdacarrier Preprint / Otto-von-Guericke-Universität, Fakultät für Informatik 2002,6 Schmitt, Ingo 1966- Verfasser (DE-588)120243989 aut Otto-von-Guericke-Universität, Fakultät für Informatik Preprint 2002,6 (DE-604)BV009874748 2002,6 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009988059&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Balko, Sören 1974- Schmitt, Ingo 1966- Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval Otto-von-Guericke-Universität, Fakultät für Informatik Preprint |
title | Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval |
title_auth | Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval |
title_exact_search | Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval |
title_full | Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval Sören Balko ; Ingo Schmitt. [Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik] |
title_fullStr | Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval Sören Balko ; Ingo Schmitt. [Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik] |
title_full_unstemmed | Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval Sören Balko ; Ingo Schmitt. [Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik] |
title_short | Hierarchical simplex approximation - towards improved index compression for efficient nearest neighbor retrieval |
title_sort | hierarchical simplex approximation towards improved index compression for efficient nearest neighbor retrieval |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009988059&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV009874748 |
work_keys_str_mv | AT balkosoren hierarchicalsimplexapproximationtowardsimprovedindexcompressionforefficientnearestneighborretrieval AT schmittingo hierarchicalsimplexapproximationtowardsimprovedindexcompressionforefficientnearestneighborretrieval |