@inproceedings{LiuFrommholzSongetal., author = {Liu, Haiming and Frommholz, Ingo and Song, Dawai and Schmitt, Ingo}, title = {The 8th Symposium on Future Directions in Information Access}, series = {ICTIR '18, Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval, Tianjin, China, September 14 - 17, 2018}, booktitle = {ICTIR '18, Proceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval, Tianjin, China, September 14 - 17, 2018}, publisher = {ACM}, address = {New York, NY}, isbn = {978-1-4503-5656-5}, doi = {10.1145/3234944.3237193}, pages = {S. 5}, abstract = {The 8th PhD Symposium on Future Directions in Information Access (FDIA) will be held in conjunction with the 8th International Conference on the Theory of Information Retrieval (ICTIR 2018) in Tianjin, China. The symposium aims to provide a forum for early stage researchers such as PhD students, to share their research and interact with each other and senior researchers in an informal and relaxed atmosphere. The symposium provides an excellent opportunity for the participants to promote their work and obtain experience in presenting and communicating their research. The participants will learn about different topics in the area of information access and retrieval, receive feedback on their work, meet lots of peers and hear inspiring talks.}, language = {en} } @book{SchmittSaakeTuerker, author = {Schmitt, Ingo and Saake, Gunter and T{\"u}rker, Can}, title = {Objektdatenbanken : Konzepte, Sprachen, Architekturen}, publisher = {Internat. Thomson Publ.}, address = {Bonn}, isbn = {3-8266-0258-7}, pages = {XVIII, 646}, language = {de} } @book{Schmitt, author = {Schmitt, Ingo}, title = {Schemaintegration f{\"u}r den Entwurf F{\"o}derierter Datenbanken}, publisher = {Infix}, address = {Sankt Augustin}, isbn = {3-89601-443-9}, pages = {XIV, 297}, language = {de} } @incollection{SchmittNuernbergerLehrack, author = {Schmitt, Ingo and N{\"u}rnberger, Andreas and Lehrack, Sebastian}, title = {On the Relation between Fuzzy and Quantum Logic}, series = {Views on Fuzzy Sets and Systems from Different Perspectives}, booktitle = {Views on Fuzzy Sets and Systems from Different Perspectives}, editor = {Seising, Rudolf}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-540-93801-9}, pages = {417 -- 438}, language = {en} } @inproceedings{SchmittHentschelNuernbergeretal., author = {Schmitt, Ingo and Hentschel, Christian and N{\"u}rnberger, Andreas and Stober, S.}, title = {SAFIRE: Towards Standardized Semantic Rich Image Annotation}, series = {Adaptive multimedia retrieval, user, context, and feedback, 4th international workshop, AMR 2006, Geneva, Switzerland, July, 27 - 28, 2006}, booktitle = {Adaptive multimedia retrieval, user, context, and feedback, 4th international workshop, AMR 2006, Geneva, Switzerland, July, 27 - 28, 2006}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-540-71544-3}, pages = {12 -- 27}, language = {en} } @inproceedings{Schmitt, author = {Schmitt, Ingo}, title = {Multimedia Information Retrieval - Ein kurzer {\"U}berblick.}, language = {de} } @inproceedings{GiurcaSchmittBaier, author = {Giurca, Adrian and Schmitt, Ingo and Baier, Daniel}, title = {Performing Conjoint Analysis within a Logic-based Framework}, series = {2011 Federated Conference on Computer Science and Information Systems (FedCSIS 2011), Szczecin, Poland, 18 - 21 September 2011}, booktitle = {2011 Federated Conference on Computer Science and Information Systems (FedCSIS 2011), Szczecin, Poland, 18 - 21 September 2011}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-457-70041-5}, pages = {261 -- 268}, language = {en} } @misc{SchmittZellhoefer, author = {Schmitt, Ingo and Zellh{\"o}fer, David}, title = {Interaktives Information-Retrieval auf der Basis der Polyrepr{\"a}sentation}, series = {Informatik Spektrum}, volume = {33}, journal = {Informatik Spektrum}, number = {3}, issn = {0170-6012}, pages = {183 -- 194}, language = {de} } @incollection{SchmittBaier, author = {Schmitt, Ingo and Baier, Daniel}, title = {Logic Based Conjoint Analysis Using the Commuting Quantum Query Language}, series = {Algorithms from and for Nature and Life: Classification and Data Analysis}, booktitle = {Algorithms from and for Nature and Life: Classification and Data Analysis}, editor = {Lausen, Berthold and Poel, Dirk van den and Ultsch, Alfred}, publisher = {Springer}, address = {Heidelberg-Berlin}, isbn = {978-3-319-00035-0}, pages = {481 -- 490}, language = {en} } @inproceedings{ZierenbergSchmitt, author = {Zierenberg, Marcel and Schmitt, Ingo}, title = {Optimizing the Distance Computation Order of Multi-Feature Similarity Search Indexing}, series = {Similarity Search and Applications - 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015, Proceedings}, booktitle = {Similarity Search and Applications - 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015, Proceedings}, editor = {Amato, Giuseppe and Connor, Richard and Falchi, Fabrizio and Gennaro, Claudio}, isbn = {978-3-319-25087-8}, doi = {10.1007/978-3-319-25087-8_8}, pages = {90 -- 96}, abstract = {Multi-feature search is an effective approach to similarity search. Unfortunately, the search efficiency decreases with the number of features. Several indexing approaches aim to achieve efficiency by incrementally reducing the approximation error of aggregated distance bounds. They apply heuristics to determine the distance computations order and update the object's aggregated bounds after each computation. However, the existing indexing approaches suffer from several drawbacks. They use the same computation order for all objects, do not support important types of aggregation functions and do not take the varying CPU and I/O costs of different distance computations into account. To resolve these problems, we introduce a new heuristic to determine an efficient distance computation order for each individual object. Our heuristic supports various important aggregation functions and calculates cost-benefit-ratios to incorporate the varying computation costs of different distance functions. The experimental evaluation reveals that our heuristic outperforms state-of-the-art approaches in terms of the number of distance computations as well as search time.}, language = {en} }