![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Roberto F. Santos Filho 2 Caetano Traina Jr. , Agma J. M. Traina , Roberto F. Santos Filho, Christos Faloutsos : How to improve the pruning ability of dynamic metric access methods. CIKM 2002 : 219-226 1 Roberto F. Santos Filho, Agma J. M. Traina , Caetano Traina Jr. , Christos Faloutsos : Similarity Search without Tears: The OMNI Family of All-purpose Access Methods. ICDE 2001 : 623-630 ![]() DiSC'03 © 2003 Association for Computing Machinery |