![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Yasushi Sakurai Yasushi Sakurai, Spiros Papadimitriou , Christos Faloutsos : AutoLag: Automatic Discovery of Lag Correlations in Stream Data. ICDE 2005 : 159-160 Yasushi Sakurai, Masatoshi Yoshikawa , Christos Faloutsos : FTW: Fast Similarity Search under the Time Warping Distance. PODS 2005 Yasushi Sakurai, Spiros Papadimitriou , Christos Faloutsos : BRAID: Stream Mining through Group Lag Correlations. SIGMOD Conference 2005 Takeharu Eda , Yasushi Sakurai, Toshiyuki Amagasa , Masatoshi Yoshikawa , Shunsuke Uemura , Takashi Honishi : Dynamic Range Labeling for XML Trees. EDBT Workshops 2004 : 230-239 Naoko Kosugi , Yasushi Sakurai, Masashi Morimoto : SoundCompass: A Practical Query-by-Humming System. SIGMOD Conference 2004 : 881-886 Yasushi Sakurai, Masatoshi Yoshikawa , Shunsuke Uemura , Haruhiko Kojima : An indexing technique using relative approximation for high-dimensional data. Systems and Computers in Japan 34 (12): 77-91 (2003) Yasushi Sakurai, Masatoshi Yoshikawa , Shunsuke Uemura , Haruhiko Kojima : Spatial indexing of high-dimensional data based on relative approximation. VLDB J. 11 (2): 93-108 (2002) Yasushi Sakurai, Masatoshi Yoshikawa , Ryoji Kataoka , Shunsuke Uemura : Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation. VLDB 2001 : 231-240 Yasushi Sakurai, Masatoshi Yoshikawa , Shunsuke Uemura , Haruhiko Kojima : The Subspace Coding Method: A New Indexing Scheme for High-Dimensional Data. CIKM 2000 : 210-218 Yasushi Sakurai, Masatoshi Yoshikawa , Shunsuke Uemura , Haruhiko Kojima : The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation. VLDB 2000 : 516-526 Yasushi Sakurai, Masatoshi Yoshikawa , Shunsuke Uemura : High-Dimensional Nearest Neighbor Search Based on Virtual Bounding Rectangles. FODO 1998 : 258-267 1 [ 8 ] 2 [ 8 ] 3 [ 9 ] [ 10 ] [ 11 ] 4 [ 8 ] 5 [ 4 ] 6 [ 2 ] [ 3 ] [ 5 ] [ 6 ] 7 [ 7 ] 8 [ 7 ] 9 [ 9 ] [ 11 ] 10 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 8 ] 11 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 8 ] [ 10 ] ![]() ©2005 Association for Computing Machinery |