SPIRE 2005 - PDF Preprint Papers

SPIRE 2005 International Symposium on String Processing and Information Retrieval

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SPIRE-2005 Paper

click to vote

SPIRE
2005
Springer

205views Information Technology» more SPIRE 2005»

Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces

14 years 6 months ago

Download www.dcc.uchile.cl

Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...

Rodrigo Paredes, Edgar Chávez

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	205	Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces	claim
2	160	Stemming Arabic Conjunctions and Prepositions	claim
3	155	Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups	claim
4	154	XML Retrieval with a Natural Language Interface	claim
5	149	Lydia: A System for Large-Scale News Analysis	claim
6	146	Cache-Conscious Collision Resolution in String Hash Tables	claim
7	137	Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences	claim
8	119	Restricted Transposition Invariant Approximate String Matching Under Edit Distance	claim
9	117	Retrieval Status Values in Information Retrieval Evaluation	claim
10	117	Counting Suffix Arrays and Strings	claim
11	116	An Edit Distance Between RNA Stem-Loops	claim
12	116	Classifying Sentences Using Induced Structure	claim
13	103	Fast Plagiarism Detection System	claim
14	102	Faster Generation of Super Condensed Neighbourhoods Using Finite Automata	claim
15	101	Necklace Swap Problem for Rhythmic Similarity Measures	claim
16	100	XML Multimedia Retrieval	claim
17	97	Deriving TF-IDF as a Fisher Kernel	claim
18	96	A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison	claim
19	92	Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity	claim
20	85	Rank-Sensitive Data Structures	claim
21	84	Composite Pattern Discovery for PCR Application	claim
22	84	Linear Time Algorithm for the Generalised Longest Common Repeat Problem	claim
23	80	A Model for Information Retrieval Based on Possibilistic Networks	claim
24	79	Practical and Optimal String Matching	claim
25	71	Normalized Similarity of RNA Sequences	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers