Advances in Spatial and Temporal Databases [[electronic resource] ] : 12th International Symposium, SSTD 2011, Minneapolis, MN, USA, August 24-26, 2011. Proceedings / / edited by Dieter Pfoser, Yufei Tao, Kyriakos Mouratidis, Mario A. Nascimento, Mohamed Mokbel, Shashi Shekhar, YAN HUANG |
Edizione | [1st ed. 2011.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Descrizione fisica | 1 online resource (XIV, 518 p.) |
Disciplina | 005.74 |
Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
Soggetto topico |
Database management
Earth sciences Data mining Application software Artificial intelligence Information technology Business—Data processing Database Management Earth Sciences, general Data Mining and Knowledge Discovery Information Systems Applications (incl. Internet) Artificial Intelligence IT in Business |
ISBN | 3-642-22922-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Keynote speech: Underexplored research topics from the commercial world / Erik Hoel -- SSCP: mining statistically significant co-location patterns / Sajib Barua, Jörg Sander -- A ontology-based traffic accident risk mapping framework / Jing Wang, Xin Wang. |
Record Nr. | UNISA-996465957703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
MobiDE 2012 : proceedings of the eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access, May 20th, 2012, Scottsdale, Arizona, USA |
Autore | Nascimento Mario A |
Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2012 |
Descrizione fisica | 1 online resource (83 pages) |
Collana | ACM Conferences |
Soggetto topico |
Engineering & Applied Sciences
Computer Science |
ISBN | 1-4503-1442-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti |
MobiDE 2012 : proceedings of the eleventh Association for Computing Machinery International Workshop on Data Engineering for Wireless and Mobile Access, May 20th, 2012, Scottsdale, Arizona, United States of America
Proceedings of the eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access |
Record Nr. | UNINA-9910376149503321 |
Nascimento Mario A
![]() |
||
[Place of publication not identified], : ACM, 2012 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Spatial and Temporal Databases [[electronic resource] ] : 13th International Symposium, SSTD 2013, Munich, Germany, August 21-23, 2013, Proceedings / / edited by Mario A. Nascimento, Timos Sellis, Reynold Cheng, Jörg Sander, Yu Zheng, Hans-Peter Kriegel, Matthias Renz, Christian Sengstock |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XVIII, 502 p. 233 illus.) |
Disciplina | 004 |
Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
Soggetto topico |
Database management
Artificial intelligence Computer science—Mathematics Data mining Database Management Artificial Intelligence Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery |
ISBN | 3-642-40235-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Joins and algorithms -- Mining and discovery -- Indexing -- Trajectories and road network data -- Nearest neighbours queries -- Uncertainty -- Demonstrations. |
Record Nr. | UNISA-996466053603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Spatial and Temporal Databases : 13th International Symposium, SSTD 2013, Munich, Germany, August 21-23, 2013, Proceedings / / edited by Mario A. Nascimento, Timos Sellis, Reynold Cheng, Jörg Sander, Yu Zheng, Hans-Peter Kriegel, Matthias Renz, Christian Sengstock |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XVIII, 502 p. 233 illus.) |
Disciplina | 004 |
Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
Soggetto topico |
Database management
Artificial intelligence Computer science—Mathematics Data mining Database Management Artificial Intelligence Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery |
ISBN | 3-642-40235-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Joins and algorithms -- Mining and discovery -- Indexing -- Trajectories and road network data -- Nearest neighbours queries -- Uncertainty -- Demonstrations. |
Record Nr. | UNINA-9910484090803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
String Processing and Information Retrieval [[electronic resource] ] : 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings / / edited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (CCCXCVI, 384 p.) |
Disciplina | 005.74 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Information storage and retrieval Data structures (Computer science) Algorithms Database management Software Engineering/Programming and Operating Systems Information Storage and Retrieval Data Structures Data Structures and Information Theory Algorithm Analysis and Problem Complexity Database Management |
ISBN | 3-540-39984-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Patterns on the Web -- Current Challenges in Bioinformatics -- Web Algorithms -- What’s Changed? Measuring Document Change in Web Crawling for Search Engines -- Link Information as a Similarity Measure in Web Classification -- A Three Level Search Engine Index Based in Query Log Distribution -- Bit-Parallel Algorithms -- Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm -- Alternative Algorithms for Bit-Parallel String Matching -- Bit-Parallel Approximate String Matching Algorithms with Transposition -- Compression -- Processing of Huffman Compressed Texts with a Super-Alphabet -- (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases -- Linear-Time Off-Line Text Compression by Longest-First Substitution -- SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases -- Categorization and Ranking -- Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model -- An Empirical Comparison of Text Categorization Methods -- Improving Text Retrieval in Medical Collections Through Automatic Categorization -- Music Retrieval -- A Bit-Parallel Suffix Automaton Approach for (?,?)-Matching in Music Retrieval -- Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval -- Multilingual Information Retrieval -- FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm -- Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants -- The Implementation and Evaluation of a Lexicon-Based Stemmer -- French Noun Phrase Indexing and Mining for an Information Retrieval System -- Subsequences and Distributed Algorithms -- New Refinement Techniques for Longest Common Subsequence Algorithms -- The Size of Subsequence Automaton -- Distributed Query Processing Using Suffix Arrays -- Algorithms on Strings and Trees -- BFT: Bit Filtration Technique for Approximate String Join in Biological Databases -- A Practical Index for Genome Searching -- Using WordNet for Word Sense Disambiguation to Support Concept Map Construction -- Memory-Adaptative Dynamic Spatial Approximation Trees -- Large Edit Distance with Multiple Block Operations. |
Record Nr. | UNISA-996465774603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
String Processing and Information Retrieval : 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings / / edited by Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (CCCXCVI, 384 p.) |
Disciplina | 005.74 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Information storage and retrieval Data structures (Computer science) Algorithms Database management Software Engineering/Programming and Operating Systems Information Storage and Retrieval Data Structures Data Structures and Information Theory Algorithm Analysis and Problem Complexity Database Management |
ISBN | 3-540-39984-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Patterns on the Web -- Current Challenges in Bioinformatics -- Web Algorithms -- What’s Changed? Measuring Document Change in Web Crawling for Search Engines -- Link Information as a Similarity Measure in Web Classification -- A Three Level Search Engine Index Based in Query Log Distribution -- Bit-Parallel Algorithms -- Row-wise Tiling for the Myers’ Bit-Parallel Approximate String Matching Algorithm -- Alternative Algorithms for Bit-Parallel String Matching -- Bit-Parallel Approximate String Matching Algorithms with Transposition -- Compression -- Processing of Huffman Compressed Texts with a Super-Alphabet -- (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases -- Linear-Time Off-Line Text Compression by Longest-First Substitution -- SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases -- Categorization and Ranking -- Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model -- An Empirical Comparison of Text Categorization Methods -- Improving Text Retrieval in Medical Collections Through Automatic Categorization -- Music Retrieval -- A Bit-Parallel Suffix Automaton Approach for (?,?)-Matching in Music Retrieval -- Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval -- Multilingual Information Retrieval -- FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm -- Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants -- The Implementation and Evaluation of a Lexicon-Based Stemmer -- French Noun Phrase Indexing and Mining for an Information Retrieval System -- Subsequences and Distributed Algorithms -- New Refinement Techniques for Longest Common Subsequence Algorithms -- The Size of Subsequence Automaton -- Distributed Query Processing Using Suffix Arrays -- Algorithms on Strings and Trees -- BFT: Bit Filtration Technique for Approximate String Join in Biological Databases -- A Practical Index for Genome Searching -- Using WordNet for Word Sense Disambiguation to Support Concept Map Construction -- Memory-Adaptative Dynamic Spatial Approximation Trees -- Large Edit Distance with Multiple Block Operations. |
Record Nr. | UNINA-9910144031803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|