| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Mario A. Nascimento Christian Digout , Mario A. Nascimento, Alexandru Coman : Similarity Search and Dimensionality Reduction: Not All Dimensions Are Equally Useful. DASFAA 2004 : 831-842 Mario A. Nascimento, Edleno Silva de Moura , Arlindo L. Oliveira : String Processing and Information Retrieval, 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings Springer 2003 Alexandru Coman , Jörg Sander , Mario A. Nascimento: Efficient Indexing of High Dimensional Normalized Histograms. DEXA 2003 : 601-610 Jie Luo , Mario A. Nascimento: Content based sub-image retrieval via hierarchical tree matching. MMDB 2003 : 63-69 Jeffery Antoniuk , Mario A. Nascimento: A light weight PDA-friendly collection fusion technique. SIGIR 2003 : 439-440 Mario A. Nascimento, Dieter Pfoser , Yannis Theodoridis : Synthetic and Real Spatiotemporal Datasets. IEEE Data Eng. Bull. 26 (2): 26-32 (2003) Mario A. Nascimento, Alon Y. Halevy , Jayant Madhavan , Philip A. Bernstein : Discovering Structure in a Corpus of Schemas. IEEE Data Eng. Bull. 26 (3): 26-33 (2003) Mario A. Nascimento, Veena Sridhar , Xiaobo Li : Effective and efficient region-based image retrieval. J. Vis. Lang. Comput. 14 (2): 151-179 (2003) Renato O. Stehling , Mario A. Nascimento, Alexandre X. Falcão : Cell Histograms Versus Color Histograms for Image Representation and Retrieval. Knowl. Inf. Syst 5 (3): 315-336 (2003) Mario A. Nascimento, K. Selçuk Candan , Noboru Babaguchi : Guest Editorial: Best Papers of the ACM Multimedia 2001 Workshop on Multimedia Information Retrieval. Multimedia Tools Appl. 21 (1): 5-7 (2003) Mario A. Nascimento: Peer-to-peer: harnessing the power of disruptive technologies. SIGMOD Record 32 (2): 57-58 (2003) Mario A. Nascimento, Jörg Sander , Jeffrey Pound : Analysis of SIGMOD's co-authorship graph. SIGMOD Record 32 (3): 8-10 (2003) Mario A. Nascimento, M. Tamer Özsu , Osmar R. Zaïane : International Database Engineering & Applications Symposium, IDEAS'02, July 17-19, 2002, Edmonton, Canada, Proceedings IEEE Computer Society 2002 Renato O. Stehling , Mario A. Nascimento, Alexandre X. Falcão : A compact and efficient image retrieval approach based on border/interior pixel classification. CIKM 2002 : 102-109 Tao Wang , Juhua Shi , Mario A. Nascimento: Experimental Results Towards Content-Based Sub-Image Retrieval. ITCC 2002 : 230-235 Mario A. Nascimento, Vishal Chitkara : Color-based image retrieval using binary signatures. SAC 2002 : 687-692 Renato O. Stehling , Mario A. Nascimento, Alexandre X. Falcão : MiCRoM: A Metric Distance to Compare Segmented Images. VISUAL 2002 : 12-23 Veena Sridhar , Mario A. Nascimento, Xiaobo Li : Region-Based Image Retrieval Using Multiple-Features. VISUAL 2002 : 61-75 Mario A. Nascimento, Eleni Tousidou , Vishal Chitkara , Yannis Manolopoulos : Image indexing and retrieval using signature trees. Data Knowl. Eng. 43 (1): 57-77 (2002) Renato O. Stehling , Mario A. Nascimento, Alexandre X. Falcão : An Adaptive and Efficient Clustering-Based Approach for Content-Based Image Retrieval in Image Databases. IDEAS 2001 : 356-365 Renato O. Stehling , Mario A. Nascimento, Alexandre X. Falcão : On "shapes" of colors for content-based image retrieval. ACM Multimedia Workshops 2000 : 171-174 Nathan G. Colossi , Mario A. Nascimento: Benchmarking Access Structures for the Similarity Retrieval of High-Dimensional Multimedia Data. IEEE International Conference on Multimedia and Expo (II) 2000 : 1215-1218 Jefferson R. O. Silva , Mario A. Nascimento: An Incremental Batch-Oriented Index for Bitemporal Databases. TIME 2000 : 133-142 Yannis Theodoridis , Mario A. Nascimento: Generating Spatiotemporal Datasets on the WWW. SIGMOD Record 29 (3): 39-43 (2000) Yannis Theodoridis , Jefferson R. O. Silva , Mario A. Nascimento: On the Generation of Spatiotemporal Datasets. SSD 1999 : 147-164 Mario A. Nascimento, Jefferson R. O. Silva , Yannis Theodoridis : Evaluation of Access Structures for Discretely Moving Points. Spatio-Temporal Database Management 1999 : 171-188 Mario A. Nascimento, Margaret H. Dunham : Indexing Valid Time Databases via B + -Trees. IEEE Trans. Knowl. Data Eng. 11 (6): 929-947 (1999) Mario A. Nascimento, Claudia Bauzer Medeiros : Report on the 13th Brazilian Symposium on Database Systems (SBBD'98). SIGMOD Record 28 (1): 76-77 (1999) Mario A. Nascimento: A Two-Stage B+-tree Based Approach to Index Transaction Time. IADT 1998 : 513-520 Mario A. Nascimento, Jefferson R. O. Silva : Towards historical R-trees. SAC 1998 : 235-240 Mario A. Nascimento, Adriano C. R. da Cunha : An Experiment Stemming Non-Traditional Text. SPIRE 1998 : 75-80 Glaucia Faria , Claudia Bauzer Medeiros , Mario A. Nascimento: An Extensible Framework for Spatio-Temporal Database Applications. SSDBM 1998 : 202-205 Mario A. Nascimento, Margaret H. Dunham : Using Two B+-Trees to Efficiently Process Inclusion Spatial Queries (Extended Abstract). ACM-GIS 1997 : 5-8 Mario A. Nascimento, Margaret H. Dunham : A Proposal for Indexing Bitemporal Databases via Cooperative B+-trees. IDEAS 1997 : 349-357 Jun-Lin Lin , Margaret H. Dunham , Mario A. Nascimento: A Survey of Distributed Database Checkpointing. Distributed and Parallel Databases 5 (3): 289-319 (1997) Mario A. Nascimento, Margaret H. Dunham , Ramez Elmasri : M-IVTT: An Index for Bitemporal Databases. DEXA 1996 : 779-790 Mario A. Nascimento, Margaret H. Dunham : Indexing a transaction-decision time database. SAC 1996 : 166-172 Clenio F. Salviano , Mario A. Nascimento, Murat M. Tanik : A Simple Approach to Improve the Abstraction Level of Object Representation. CAST 1994 : 349-362 Mario A. Nascimento, Clenio F. Salviano , Murat M. Tanik : Using Logic Programming to Test Module Specifications in Early Stages of Software Development. CAST 1994 : 373-387 1 [ 35 ] 2 [ 30 ] 3 [ 33 ] 4 [ 30 ] 5 [ 21 ] [ 24 ] 6 [ 18 ] 7 [ 37 ] [ 39 ] 8 [ 9 ] 9 [ 39 ] 10 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 13 ] 11 [ 4 ] 12 [ 19 ] [ 20 ] [ 23 ] [ 26 ] [ 31 ] 13 [ 8 ] 14 [ 33 ] 15 [ 22 ] [ 32 ] 16 [ 5 ] 17 [ 36 ] 18 [ 33 ] 19 [ 21 ] 20 [ 8 ] [ 12 ] 21 [ 38 ] 22 [ 38 ] 23 [ 27 ] 24 [ 34 ] 25 [ 28 ] 26 [ 1 ] [ 2 ] 27 [ 28 ] [ 37 ] 28 [ 25 ] 29 [ 10 ] [ 14 ] [ 15 ] [ 17 ] 30 [ 22 ] [ 32 ] 31 [ 19 ] [ 20 ] [ 23 ] [ 26 ] [ 31 ] 32 [ 1 ] [ 2 ] 33 [ 14 ] [ 15 ] [ 16 ] [ 34 ] 34 [ 21 ] 35 [ 25 ] 36 [ 27 ]  ©2004 Association for Computing Machinery |
