| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Mario A. Nascimento Alexandru Coman , Mario A. Nascimento, Jörg Sander : Exploiting redundancy in sensor networks for energy efficient processing of spatiotemporal region queries. CIKM 2005 : 187-194 Christian Digout , Mario A. Nascimento: High-Dimensional Similarity Searches Using A Metric Pseudo-Grid. ICDE Workshops 2005 : 1174 Alexandru Coman , Jörg Sander , Mario A. Nascimento: An Analysis of Spatio-Temporal Query Processing in Sensor Networks. ICDE Workshops 2005 : 1190 Ruan J. S. Belém , João M. B. Cavalcanti , Edleno Silva de Moura , Mario A. Nascimento: SNIF: A Simple Nude Image Finder. LA-WEB 2005 : 252-258 Yong-Il Kwon , Ho-Hyun Park , Jixue Liu , Mario A. Nascimento: Radial Projection: A Feature Extraction Method for Topographical Shapes. PCM (1) 2005 : 582-593 Slobodan Rasetic , Jörg Sander , James Elding , Mario A. Nascimento: A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing. VLDB 2005 : 934-945 Edleno Silva de Moura , Célia F. dos Santos , Daniel R. Fernandes , Altigran Soares da Silva , Pável Calado , Mario A. Nascimento: Improving Web search efficiency via a locality based static pruning method. WWW 2005 : 235-244 Mario A. Nascimento, M. Tamer Özsu , Donald Kossmann , Renée J. Miller , José A. Blakeley , K. Bernhard Schiefer : (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, August 31 - September 3 2004 Morgan Kaufmann 2004 Jörg Sander , Mario A. Nascimento: Spatio-Temporal Database Management, 2nd International Workshop STDBM'04, Toronto, Canada, August 30, 2004 STDBM 2004 Christian Digout , Mario A. Nascimento, Alexandru Coman : Similarity Search and Dimensionality Reduction: Not All Dimensions Are Equally Useful. DASFAA 2004 : 831-842 Daniel Mallett , James Elding , Mario A. Nascimento: Information-Content Based Sentence Extraction for Text Summarization. ITCC (2) 2004 : 214-218 Jie Luo , Mario A. Nascimento: Content-based sub-image retrieval using relevance feedback. MMDB 2004 : 2-9 Luca Pireddu , Mario A. Nascimento: Taxonomy-Based Routing Indices for Peer-to-Peer Networks. Workshop on Peer-to-Peer Information Retrieval 2004 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 Ricardo Rodrigues Ciferri , Ana Carolina Salgado , Valéria Cesário Times , Mario A. Nascimento, Geovane Cayres Magalhães : A Performance Comparison among the Traditional R-trees, the Hilbert R-tree and the SR-tree. SCCC 2003 : 3-12 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, 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 [ 34 ] 2 [ 30 ] 3 [ 48 ] 4 [ 44 ] 5 [ 45 ] 6 [ 30 ] 7 [ 48 ] 8 [ 21 ] [ 24 ] 9 [ 35 ] 10 [ 18 ] 11 [ 37 ] [ 42 ] [ 49 ] [ 51 ] 12 [ 9 ] 13 [ 42 ] [ 50 ] 14 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 13 ] 15 [ 41 ] [ 46 ] 16 [ 4 ] 17 [ 19 ] [ 20 ] [ 23 ] [ 26 ] [ 31 ] 18 [ 8 ] 19 [ 45 ] 20 [ 44 ] 21 [ 47 ] 22 [ 22 ] [ 32 ] 23 [ 5 ] 24 [ 47 ] 25 [ 36 ] [ 40 ] 26 [ 35 ] 27 [ 41 ] 28 [ 21 ] 29 [ 8 ] [ 12 ] 30 [ 44 ] 31 [ 38 ] [ 45 ] [ 48 ] 32 [ 38 ] 33 [ 27 ] [ 44 ] 34 [ 47 ] 35 [ 33 ] 36 [ 39 ] 37 [ 28 ] 38 [ 46 ] 39 [ 35 ] 40 [ 1 ] [ 2 ] 41 [ 28 ] [ 37 ] [ 43 ] [ 46 ] [ 49 ] [ 51 ] 42 [ 45 ] 43 [ 44 ] 44 [ 25 ] 45 [ 45 ] 46 [ 10 ] [ 14 ] [ 15 ] [ 17 ] 47 [ 22 ] [ 32 ] 48 [ 19 ] [ 20 ] [ 23 ] [ 26 ] [ 31 ] 49 [ 1 ] [ 2 ] 50 [ 14 ] [ 15 ] [ 16 ] [ 33 ] 51 [ 35 ] 52 [ 21 ] 53 [ 25 ] 54 [ 27 ]  ©2006 Association for Computing Machinery |
