-
1
-
-
0040154165
-
Re-Designing Distance Functions and Distance-Based Applications for High Dimensional Data
-
C. Aggarwal, "Re-Designing Distance Functions and Distance-Based Applications for High Dimensional Data," ACM SIGMOD, vol. 30, no. 1, pp. 13-18, 2001.
-
(2001)
ACM SIGMOD
, vol.30
, Issue.1
, pp. 13-18
-
-
Aggarwal, C.1
-
2
-
-
84949479246
-
On the Surprising Behavior of Distance, Metrics in High Dimensional Spaces
-
C. Aggarwal, A. Hinneburg, and D. Keim, "On the Surprising Behavior of Distance, Metrics in High Dimensional Spaces," Proc. Eighth Int'l Conf. Database Theory, pp. 420-434, 2001.
-
(2001)
Proc. Eighth Int'l Conf. Database Theory
, pp. 420-434
-
-
Aggarwal, C.1
Hinneburg, A.2
Keim, D.3
-
3
-
-
0004931376
-
Efficient Algorithms for Normalized Edit Distance
-
A. Arslan and O. Egecioglu, "Efficient Algorithms for Normalized Edit Distance," J. Discrete Algorithms, vol. 1, no. 1, pp. 3-20, 2000.
-
(2000)
J. Discrete Algorithms
, vol.1
, Issue.1
, pp. 3-20
-
-
Arslan, A.1
Egecioglu, O.2
-
4
-
-
0028257199
-
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimension
-
S. Arya, D. Mount, N. Netanyanu, R. Silverman, and A. Wu, "An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimension," Proc. Fifth Symp. Discrete Algorithms, pp. 573-583, 1994.
-
(1994)
Proc. Fifth Symp. Discrete Algorithms
, pp. 573-583
-
-
Arya, S.1
Mount, D.2
Netanyanu, N.3
Silverman, R.4
Wu, A.5
-
5
-
-
85026780237
-
Proximity Matching Using Fixed-Queries Trees
-
R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu, "Proximity Matching Using Fixed-Queries Trees," Proc. Fifth Combinatorial Pattern Matching, pp. 198-212, 1994.
-
(1994)
Proc. Fifth Combinatorial Pattern Matching
, pp. 198-212
-
-
Baeza-Yates, R.1
Cunto, W.2
Manber, U.3
Wu, S.4
-
7
-
-
0016557674
-
Moltidimensional Binary Search Trees Used for Associative Searching
-
J. Bentley, "Moltidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, 1975.
-
(1975)
Comm. ACM
, vol.18
, Issue.9
, pp. 509-517
-
-
Bentley, J.1
-
8
-
-
0002162263
-
Near Neighbor Search in Large Metric Spaces
-
S. Brin, "Near Neighbor Search in Large Metric Spaces," Proc. 21st Very Large Databases, pp. 574-584, 1995.
-
(1995)
Proc. 21st Very Large Databases
, pp. 574-584
-
-
Brin, S.1
-
9
-
-
0015531930
-
Some Approaches to Best-Match File Searching
-
W. Burkhard and R. Keller, "Some Approaches to Best-Match File Searching," Comm. ACM, vol. 16, no. 4, pp. 230-236, 1973.
-
(1973)
Comm. ACM
, vol.16
, Issue.4
, pp. 230-236
-
-
Burkhard, W.1
Keller, R.2
-
10
-
-
10644227003
-
Probabilistic Proximity Search Algorithms Based on Compact Partitions
-
B. Bustos and G. Navarro, "Probabilistic Proximity Search Algorithms Based on Compact Partitions," J. Discrete Algorithms, Vol. 2, no. 1, pp. 115-134, 2003.
-
(2003)
J. Discrete Algorithms
, vol.2
, Issue.1
, pp. 115-134
-
-
Bustos, B.1
Navarro, G.2
-
13
-
-
0035366856
-
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
-
E. Chávez, J.L. Marroquin, and G. Navarro, "Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching," Multimedia Tools and Applications, vol. 14, no. 2, pp. 113-135, 2001.
-
(2001)
Multimedia Tools and Applications
, vol.14
, Issue.2
, pp. 113-135
-
-
Chávez, E.1
Marroquin, J.L.2
Navarro, G.3
-
14
-
-
0037448286
-
Probabilistic Proximity Search: Fighting the Curse of Dimensionality in Metric Spaces
-
F. Chávez and G. Navarro, "Probabilistic Proximity Search: Fighting the Curse of Dimensionality in Metric Spaces," Information Processing Letters, vol. 85, no. 1, pp. 39-46, 2003.
-
(2003)
Information Processing Letters
, vol.85
, Issue.1
, pp. 39-46
-
-
Chávez, F.1
Navarro, G.2
-
15
-
-
18444400570
-
A Compact Space Decomposition for Effective Metric Indexing
-
E. Chávez and G. Navarro, "A Compact Space Decomposition for Effective Metric Indexing," Pattern Recognition Letters, vol. 26, no. 9, pp. 1363-1376, 2005.
-
(2005)
Pattern Recognition Letters
, vol.26
, Issue.9
, pp. 1363-1376
-
-
Chávez, E.1
Navarro, G.2
-
16
-
-
0345043999
-
Proximity Searching in Metric Spaces
-
E. Chávez, G. Navarro, R. Baeza-Yates, and J. Marroquín, "Proximity Searching in Metric Spaces," ACM Computing Surveys, vol. 33, no. 3, pp. 273-321, 2001.
-
(2001)
ACM Computing Surveys
, vol.33
, Issue.3
, pp. 273-321
-
-
Chávez, E.1
Navarro, G.2
Baeza-Yates, R.3
Marroquín, J.4
-
17
-
-
0033906160
-
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
-
P. Ciaccia and M. Patella, "PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces," Proc. 16th Int'l Conf. Data Eng., pp. 244-255, 2000.
-
(2000)
Proc. 16th Int'l Conf. Data Eng
, pp. 244-255
-
-
Ciaccia, P.1
Patella, M.2
-
18
-
-
33745602932
-
Searching in Metric Spaces with User-Defined and Approximate Distances
-
P. Ciaccia and M. Patella, "Searching in Metric Spaces with User-Defined and Approximate Distances," ACM Trans. Database Systems vol. 27, no. 4, pp. 398-437, 2002.
-
(2002)
ACM Trans. Database Systems
, vol.27
, Issue.4
, pp. 398-437
-
-
Ciaccia, P.1
Patella, M.2
-
19
-
-
84993661659
-
M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces
-
P. Ciaccia, M. Patella, and P. Zezula, "M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces," Proc. 23rd Conf. Very Large Databases, pp. 426-435, 1997.
-
(1997)
Proc. 23rd Conf. Very Large Databases
, pp. 426-435
-
-
Ciaccia, P.1
Patella, M.2
Zezula, P.3
-
20
-
-
0033453107
-
Nearest Neighbor Queries in Metric Spaces
-
K. Clarkson, "Nearest Neighbor Queries in Metric Spaces," Discrete Computational Geometry, vol. 22, no. 1, pp. 63-93, 1999.
-
(1999)
Discrete Computational Geometry
, vol.22
, Issue.1
, pp. 63-93
-
-
Clarkson, K.1
-
24
-
-
1442355935
-
Comparing Top k Lists
-
R. Fagin, R. Kumar, and D. Sivakumar, "Comparing Top k Lists," SIAM J. Discrete Math., vol. 17, no. 1, pp. 134-160, 2003.
-
(2003)
SIAM J. Discrete Math
, vol.17
, Issue.1
, pp. 134-160
-
-
Fagin, R.1
Kumar, R.2
Sivakumar, D.3
-
25
-
-
33746059374
-
On the Least Cost for Proximity Seqrching in Metric Spaces
-
K. Figueroa, E. Chávez, G. Navarro, and R. Paredes, "On the Least Cost for Proximity Seqrching in Metric Spaces," Proc. Fifth Workshop Efficient and Experimental Algorithms, pp. 279-290, 2006.
-
(2006)
Proc. Fifth Workshop Efficient and Experimental Algorithms
, pp. 279-290
-
-
Figueroa, K.1
Chávez, E.2
Navarro, G.3
Paredes, R.4
-
26
-
-
48049123405
-
-
D. Harman, Overview of the Third Text REtrieval Conf., Proc. Third Text REtrieval Conf., NIST Special Publication 500-2, pp. 1-19, 1995.
-
D. Harman, "Overview of the Third Text REtrieval Conf.," Proc. Third Text REtrieval Conf., NIST Special Publication 500-2, pp. 1-19, 1995.
-
-
-
-
27
-
-
0041664272
-
Index-Driven Similarity Search in Metric Spaces
-
G. Hjaltason and H. Samet, "Index-Driven Similarity Search in Metric Spaces," ACM Trans. Database Systems, vol. 28, no. 4, pp. 517-580, 2003.
-
(2003)
ACM Trans. Database Systems
, vol.28
, Issue.4
, pp. 517-580
-
-
Hjaltason, G.1
Samet, H.2
-
28
-
-
24644475201
-
Fractional Distance Measures for Content-Based Image Retrieval
-
P. Howarth and S. Rüger, "Fractional Distance Measures for Content-Based Image Retrieval," Proc. 27th European Conf. IR Research, pp. 447-456, 2005.
-
(2005)
Proc. 27th European Conf. IR Research
, pp. 447-456
-
-
Howarth, P.1
Rüger, S.2
-
29
-
-
0020428412
-
Computational Geometric Problems in Pattern Recognition
-
Pattern Recognition Theory and Applications, O.J. Kittler, ed
-
G.T. Toussaint, "Computational Geometric Problems in Pattern Recognition," Pattern Recognition Theory and Applications, O.J. Kittler, ed., NATO ASTI series, 1981.
-
(1981)
NATO ASTI series
-
-
Toussaint, G.T.1
-
30
-
-
0020824191
-
A Data Structure and an Algorithm for the Nearest Point Problen
-
I. Kalantari and G. McDonald, "A Data Structure and an Algorithm for the Nearest Point Problen" IEEE Trans. Software Eng., vol. 9, no. 5, 1983.
-
(1983)
IEEE Trans. Software Eng
, vol.9
, Issue.5
-
-
Kalantari, I.1
McDonald, G.2
-
32
-
-
0003159276
-
A New Version of the Nearest-Neighbor Approximating and Eliminating Search (AESA) with Linear Preprocessing-Time and Memory Requirements
-
L. Micó, J. Oncina, and E. Vidal, "A New Version of the Nearest-Neighbor Approximating and Eliminating Search (AESA) with Linear Preprocessing-Time and Memory Requirements," Pattern Recognition Letters, vol. 15, pp. 9-17, 1994.
-
(1994)
Pattern Recognition Letters
, vol.15
, pp. 9-17
-
-
Micó, L.1
Oncina, J.2
Vidal, E.3
-
33
-
-
0036706560
-
Searching in Metric Spaces by Spatial Approximation
-
G. Navarro, "Searching in Metric Spaces by Spatial Approximation," Very Large Databases J., vol. 11, no. 1, pp. 28-46, 2002.
-
(2002)
Very Large Databases J
, vol.11
, Issue.1
, pp. 28-46
-
-
Navarro, G.1
-
35
-
-
33746084482
-
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
-
R. Paredes, E. Chávez, K. Figueroa, and G. Navarro, "Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces," Proc. Fifth Workshop Efficient and Experimental Algorithms, pp. 85-97, 2006.
-
(2006)
Proc. Fifth Workshop Efficient and Experimental Algorithms
, pp. 85-97
-
-
Paredes, R.1
Chávez, E.2
Figueroa, K.3
Navarro, G.4
-
37
-
-
0032045780
-
The FERET Database and Evaluation Procedure for Face Recognition Algorithms
-
P. Phillips, H. Wechsler, J. Huang, and P. Rauss, "The FERET Database and Evaluation Procedure for Face Recognition Algorithms," Image and Vision Computing J., vol. 16, no. 5, pp. 295-306, 1998.
-
(1998)
Image and Vision Computing J
, vol.16
, Issue.5
, pp. 295-306
-
-
Phillips, P.1
Wechsler, H.2
Huang, J.3
Rauss, P.4
-
39
-
-
33745601374
-
On Fast Non-Metric Similarity Search by Metric Access Methods
-
T. Skopal, "On Fast Non-Metric Similarity Search by Metric Access Methods," Proc. Int'l Conf. Extending Database Technology, pp. 718-736, 2006.
-
(2006)
Proc. Int'l Conf. Extending Database Technology
, pp. 718-736
-
-
Skopal, T.1
-
40
-
-
0022858293
-
An Algorithm for Finding Nearest Neighbors in (Approximately) Constant Average Time
-
E. Vidal, "An Algorithm for Finding Nearest Neighbors in (Approximately) Constant Average Time," Pattern Recognition Letters vol. 4. pp. 145-157, 1986.
-
(1986)
Pattern Recognition Letters
, vol.4
, pp. 145-157
-
-
Vidal, E.1
-
41
-
-
0003981696
-
Algorithms and Strategies for Similarity Retrieval,
-
Technical Report VCL-96-101, Visual Computing Laboratory, Univ. of California San Diego, July
-
D. White and R. Jain, "Algorithms and Strategies for Similarity Retrieval," Technical Report VCL-96-101, Visual Computing Laboratory, Univ. of California San Diego, July 1996.
-
(1996)
-
-
White, D.1
Jain, R.2
-
42
-
-
48049111935
-
-
P. Yianilos, Excluded Middle Vantage Point Forests for Nearest Neighbor Search, DIMACS Implementation Challenge, Proc. Int'l Workshop Algorithm Eng. and Experimentation, 1999.
-
P. Yianilos, "Excluded Middle Vantage Point Forests for Nearest Neighbor Search," DIMACS Implementation Challenge, Proc. Int'l Workshop Algorithm Eng. and Experimentation, 1999.
-
-
-
-
43
-
-
4243289916
-
Locally Lifting the Curse of Dimensionality for Nearest Neighbor Search,
-
NEC Research Inst, June
-
P.N. Yianilos, "Locally Lifting the Curse of Dimensionality for Nearest Neighbor Search," technical report, NEC Research Inst., June 1999.
-
(1999)
technical report
-
-
Yianilos, P.N.1
-
44
-
-
34249675404
-
Similarity Search: The Metric Space Approach
-
P. Zezula, G. Amato, V. Dohnal, and M. Batko, "Similarity Search: The Metric Space Approach," Advances in Database Systems, vol. 32, 2006.
-
(2006)
Advances in Database Systems
, vol.32
-
-
Zezula, P.1
Amato, G.2
Dohnal, V.3
Batko, M.4
|