-
1
-
-
0031605774
-
Active disks: Programming model, algorithms and evaluation
-
May
-
A. Acharya, M. Uysal, and J. Saltz, "Active Disks: Programming Model, Algorithms and Evaluation," Proc. Eighth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 81-91, May 1998.
-
(1998)
Proc. Eighth Int'l Conf. Architectural Support for Programming Languages and Operating Systems
, pp. 81-91
-
-
Acharya, A.1
Uysal, M.2
Saltz, J.3
-
2
-
-
85006228721
-
Efficient similarity search in sequence databases
-
R. Agrawal, C. Faloutsos, and A. Swami, "Efficient Similarity Search in Sequence Databases," Proc. Fourth Int'l Conf. Foundations of Data Organization and Algorithms, pp. 69-84, 1993.
-
(1993)
Proc. Fourth Int'l Conf. Foundations of Data Organization and Algorithms
, pp. 69-84
-
-
Agrawal, R.1
Faloutsos, C.2
Swami, A.3
-
3
-
-
0025447750
-
The R*tree: An efficient and robust access method for points and rectangles
-
May
-
N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, "The R*Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322-331, May 1990.
-
(1990)
Proc. ACM SIGMOD Int'l Conf. Management of Data
, pp. 322-331
-
-
Beckmann, N.1
Kriegel, H.2
Schneider, R.3
Seeger, B.4
-
4
-
-
0030679825
-
A cost model for nearest neighbor search in high-dimensional data space
-
S. Berchtold, C. Bohm, D. Keim, and H. Kriegel, "A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space," Proc. ACM Symp. Principles of Database Systems, 1997.
-
(1997)
Proc. ACM Symp. Principles of Database Systems
-
-
Berchtold, S.1
Bohm, C.2
Keim, D.3
Kriegel, H.4
-
5
-
-
0032094513
-
The pyramid-technique: Towards breaking the curse of dimensionality
-
June
-
S. Berchtold, C. Bohm, and H.-P. Kriegel, "The Pyramid-Technique: Towards Breaking the Curse of Dimensionality," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 142-153, June 1998.
-
(1998)
Proc. ACM SIGMOD Int'l Conf. Management of Data
, pp. 142-153
-
-
Berchtold, S.1
Bohm, C.2
Kriegel, H.-P.3
-
6
-
-
0001802606
-
The X-tree: An index structure for high-dimensional data
-
S. Berchtold, D. Keim, and H. Kriegel, "The X-Tree: An Index Structure for High-Dimensional Data," Proc. Int'l Conf. Very Large Data Bases, pp. 28-39, 1996.
-
(1996)
Proc. Int'l Conf. Very Large Data Bases
, pp. 28-39
-
-
Berchtold, S.1
Keim, D.2
Kriegel, H.3
-
7
-
-
85017237088
-
The asilomar report on database research
-
Dec.
-
P. Bernstein, M. Brodie, S. Ceri, D. DeWitt, M. Franklin, H. Garcia-Molina, J. Gray, J. Held, J. Hellerstein, H. Jagadish, M. Lesk, D. Maier, J. Naughton, H. Pirahesh, M. Stonebraker, and J. Ullman, "The Asilomar Report on Database Research," Sigmod Record, vol. 27, no. 4, Dec. 1998.
-
(1998)
Sigmod Record
, vol.27
, Issue.4
-
-
Bernstein, P.1
Brodie, M.2
Ceri, S.3
DeWitt, D.4
Franklin, M.5
Garcia-Molina, H.6
Gray, J.7
Held, J.8
Hellerstein, J.9
Jagadish, H.10
Lesk, M.11
Maier, D.12
Naughton, J.13
Pirahesh, H.14
Stonebraker, M.15
Ullman, J.16
-
10
-
-
0005287692
-
Local dimensionality reduction: A new approach to indexing high dimensional spaces
-
K. Chakrabarti and S. Mehrotra, "Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces," The VLDB J., pp. 89-100, 2000.
-
(2000)
The VLDB J.
, pp. 89-100
-
-
Chakrabarti, K.1
Mehrotra, S.2
-
12
-
-
0030683872
-
Scalable access within the context of digital libraries
-
X. Cheng, R. Dolin, M. Neary, S. Prabhakar, K. Ravikanth, D. Wu, D. Agrawal, A. El Abbadi, M. Freeston, A. Singh, T. Smith, and J. Su, "Scalable Access within the Context of Digital Libraries," IEEE Proc. Int'l Conf. Advances in Digital Libraries (ADL), pp. 70-81, 1997.
-
(1997)
IEEE Proc. Int'l Conf. Advances in Digital Libraries (ADL)
, pp. 70-81
-
-
Cheng, X.1
Dolin, R.2
Neary, M.3
Prabhakar, S.4
Ravikanth, K.5
Wu, D.6
Agrawal, D.7
El Abbadi, A.8
Freeston, M.9
Singh, A.10
Smith, T.11
Su, J.12
-
13
-
-
0003733695
-
An elementary proof of the Johnson-Lindenstrauss Lemma
-
Int'l Computer Science Inst., Berkeley
-
S. Dasgupta and A. Gupta, "An Elementary Proof of the Johnson-Lindenstrauss Lemma," Technical Report TR-99-006, Int'l Computer Science Inst., Berkeley, 1999.
-
(1999)
Technical Report
, vol.TR-99-006
-
-
Dasgupta, S.1
Gupta, A.2
-
14
-
-
84989525001
-
Indexing by latent semantic analysis
-
S. Deerwester, S.T. Dumais, G.W. Furnas, T.K. Launder, and R. Harshman, "Indexing by Latent Semantic Analysis," J. Am. Soc. for Information Science, vol. 41, pp. 391-407, 1990.
-
(1990)
J. Am. Soc. for Information Science
, vol.41
, pp. 391-407
-
-
Deerwester, S.1
Dumais, S.T.2
Furnas, G.W.3
Launder, T.K.4
Harshman, R.5
-
15
-
-
34447620746
-
Improving text retrieval for the routing problem using latent semantic indexing
-
D. Hull, "Improving Text Retrieval for the Routing Problem Using Latent Semantic Indexing," Proc. 17th ACM-SIGIR Conf., pp. 282-291, 1994.
-
(1994)
Proc. 17th ACM-SIGIR Conf.
, pp. 282-291
-
-
Hull, D.1
-
16
-
-
0742306577
-
Improving the retrieval of information from external sources
-
S.T. Dumais, "Improving the Retrieval of Information from External Sources," Behavior Research Methods, Instruments and Computers, vol. 23, pp. 229-236, 1991.
-
(1991)
Behavior Research Methods, Instruments and Computers
, vol.23
, pp. 229-236
-
-
Dumais, S.T.1
-
17
-
-
25944440338
-
How to approximate the inner-product: Fast dynamic algorithms for similarity
-
Dept. of Computer Science, Univ. of California at Santa Barbara, Dec.
-
Ö. Egecioglu, "How to Approximate the Inner-Product: Fast Dynamic Algorithms for Similarity," Technical Report TRCS98-37, Dept. of Computer Science, Univ. of California at Santa Barbara, Dec. 1998.
-
(1998)
Technical Report
, vol.TRCS98-37
-
-
Egecioglu, O.1
-
19
-
-
34249772390
-
Efficient and effective querying by image content
-
C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz, "Efficient and Effective Querying by Image Content," J. Intelligent Information Systems, vol. 3, pp. 231-262, 1994.
-
(1994)
J. Intelligent Information Systems
, vol.3
, pp. 231-262
-
-
Faloutsos, C.1
Barber, R.2
Flickner, M.3
Hafner, J.4
Niblack, W.5
Petkovic, D.6
Equitz, W.7
-
20
-
-
0028447023
-
Fast subsequence matching in time-series databases
-
May
-
C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, "Fast Subsequence Matching in Time-Series Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 419-429, May 1994.
-
(1994)
Proc. ACM SIGMOD Int'l Conf. Management of Data
, pp. 419-429
-
-
Faloutsos, C.1
Ranganathan, M.2
Manolopoulos, Y.3
-
21
-
-
85139617617
-
Vector approximation based indexing for non-uniform high dimensional data sets
-
Nov.
-
H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi, "Vector Approximation Based Indexing for Non-Uniform High Dimensional Data Sets," Proc. Ninth ACM Int'l Conf. Information and Knowledge Management, pp. 202-209, Nov. 2000.
-
(2000)
Proc. Ninth ACM Int'l Conf. Information and Knowledge Management
, pp. 202-209
-
-
Ferhatosmanoglu, H.1
Tuncel, E.2
Agrawal, D.3
El Abbadi, A.4
-
22
-
-
0034996152
-
Approximate nearest neighbor searching in multimedia databases
-
Apr.
-
H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi, "Approximate Nearest Neighbor Searching in Multimedia Databases," Proc. 17th IEEE Int'l Conf. Data Eng. (ICDE), pp. 503-511, Apr. 2001.
-
(2001)
Proc. 17th IEEE Int'l Conf. Data Eng. (ICDE)
, pp. 503-511
-
-
Ferhatosmanoglu, H.1
Tuncel, E.2
Agrawal, D.3
El Abbadi, A.4
-
23
-
-
0001944742
-
Similarity searching in high dimensions via hashing
-
Sept.
-
A. Gionis, P. Indyk, and R. Motwani, "Similarity Searching in High Dimensions via Hashing," Proc. Int'l Conf. Very Large Data Bases, pp. 518-529, Sept. 1999.
-
(1999)
Proc. Int'l Conf. Very Large Data Bases
, pp. 518-529
-
-
Gionis, A.1
Indyk, P.2
Motwani, R.3
-
29
-
-
0003134982
-
Fast nearest neighbor search in medical image databases
-
F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, "Fast Nearest Neighbor Search in Medical Image Databases," Proc. Int'l Conf. Very Large Data Bases, pp. 215-226, 1996.
-
(1996)
Proc. Int'l Conf. Very Large Data Bases
, pp. 215-226
-
-
Korn, F.1
Sidiropoulos, N.2
Faloutsos, C.3
Siegel, E.4
Protopapas, Z.5
-
30
-
-
34249762939
-
The TV-tree: An index structure for high-dimensional data
-
K. Lin, H.V. Jagadish, and C. Faloutsos, "The TV-Tree: An Index Structure for High-Dimensional Data," VLDB J., vol. 3, pp. 517-542, 1995.
-
(1995)
VLDB J.
, vol.3
, pp. 517-542
-
-
Lin, K.1
Jagadish, H.V.2
Faloutsos, C.3
-
31
-
-
0025625409
-
The hb-Tree: A multi-attribute indexing method with good guaranteed performance
-
Dec.
-
D.B. Lomet and B. Salzberg, "The hb-Tree: A Multi-Attribute Indexing Method with Good Guaranteed Performance," ACM Trans. Database Systems, vol. 15, no. 4, pp. 625-658, Dec. 1990.
-
(1990)
ACM Trans. Database Systems
, vol.15
, Issue.4
, pp. 625-658
-
-
Lomet, D.B.1
Salzberg, B.2
-
32
-
-
0030213052
-
Texture features for browsing and retrieval of image data
-
Aug.
-
B.S. Manjunath and W.Y. Ma, "Texture Features for Browsing and Retrieval of Image Data," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 8, pp. 837-42, Aug. 1996.
-
(1996)
IEEE Trans. Pattern Analysis and Machine Intelligence
, vol.18
, Issue.8
, pp. 837-842
-
-
Manjunath, B.S.1
Ma, W.Y.2
-
33
-
-
0027166611
-
The QBIC project: Querying images by content using color, texture and shape
-
Feb.
-
W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, and P. Yanker, "The QBIC Project: Querying Images by Content Using Color, Texture and Shape," Proc. SPIE Conf. 1908 on Storage and Retrieval for Image and Video Databases, vol. 1908, pp. 173-187, Feb. 1993.
-
(1993)
Proc. SPIE Conf. 1908 on Storage and Retrieval for Image and Video Databases
, vol.1908
, pp. 173-187
-
-
Niblack, W.1
Barber, R.2
Equitz, W.3
Flickner, M.4
Glasman, E.5
Petkovic, D.6
Yanker, P.7
-
35
-
-
85010847034
-
The kdb-Tree: A search structure for large. Multi-dimensional dynamic indexes
-
J.T. Robinson, "The kdb-Tree: A Search Structure for Large. Multi-Dimensional Dynamic Indexes," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 10-18, 1981.
-
(1981)
Proc. ACM SIGMOD Int'l Conf. Management of Data
, pp. 10-18
-
-
Robinson, J.T.1
-
36
-
-
84862380762
-
-
SciDAC, Scientific data management center, http://sdm.lbl.gov/sdmcenter/, 2002.
-
(2002)
-
-
-
37
-
-
84993661650
-
Efficient user-adaptable similarity search in large multimedia databases
-
T. Seidl and H.-P. Kriegel, "Efficient User-Adaptable Similarity Search in Large Multimedia Databases," Proc. Int'l Conf. Very Large Data Bases, pp. 506-515, 1997.
-
(1997)
Proc. Int'l Conf. Very Large Data Bases
, pp. 506-515
-
-
Seidl, T.1
Kriegel, H.-P.2
-
40
-
-
0242665530
-
Non-linear dimensionality reduction techniques for classification and visualization
-
July
-
M. Vlachos, C. Domeniconi, D. Gunopulos, G. Kollios, and N. Koudas, "Non-Linear Dimensionality Reduction Techniques for Classification and Visualization," Proc. Eighth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, July 2002.
-
(2002)
Proc. Eighth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining
-
-
Vlachos, M.1
Domeniconi, C.2
Gunopulos, D.3
Kollios, G.4
Koudas, N.5
-
42
-
-
0030415287
-
Efficient retrieval for browsing large image databases
-
Nov.
-
D. Wu, D. Agrawal, A. El Abbadi, and T.R. Smith, "Efficient Retrieval for Browsing Large Image Databases," Proc. Conf. Information and Knowledge Management, pp. 11-18, Nov. 1996.
-
(1996)
Proc. Conf. Information and Knowledge Management
, pp. 11-18
-
-
Wu, D.1
Agrawal, D.2
El Abbadi, A.3
Smith, T.R.4
|