Published in: LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023)
Yu Feng, Linfang Ding, and Guohui Xiao. GeoQAMap - Geographic Question Answering with Maps Leveraging LLM and Open Knowledge Base (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 28:1-28:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{feng_et_al:LIPIcs.GIScience.2023.28, author = {Feng, Yu and Ding, Linfang and Xiao, Guohui}, title = {{GeoQAMap - Geographic Question Answering with Maps Leveraging LLM and Open Knowledge Base}}, booktitle = {12th International Conference on Geographic Information Science (GIScience 2023)}, pages = {28:1--28:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-288-4}, ISSN = {1868-8969}, year = {2023}, volume = {277}, editor = {Beecham, Roger and Long, Jed A. and Smith, Dianna and Zhao, Qunshan and Wise, Sarah}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2023.28}, URN = {urn:nbn:de:0030-drops-189233}, doi = {10.4230/LIPIcs.GIScience.2023.28}, annote = {Keywords: Geographic Question Answering, Large Language Models, SPARQL, Knowledge Base, Wikidata} }
Published in: LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023)
Alex Hagen-Zanker, Jingyan Yu, Naratip Santitissadeekorn, and Susan Hughes. Characterizing Urban Expansion Processes Using Dynamic Spatial Models – a European Application (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 36:1-36:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{hagenzanker_et_al:LIPIcs.GIScience.2023.36, author = {Hagen-Zanker, Alex and Yu, Jingyan and Santitissadeekorn, Naratip and Hughes, Susan}, title = {{Characterizing Urban Expansion Processes Using Dynamic Spatial Models – a European Application}}, booktitle = {12th International Conference on Geographic Information Science (GIScience 2023)}, pages = {36:1--36:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-288-4}, ISSN = {1868-8969}, year = {2023}, volume = {277}, editor = {Beecham, Roger and Long, Jed A. and Smith, Dianna and Zhao, Qunshan and Wise, Sarah}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2023.36}, URN = {urn:nbn:de:0030-drops-189312}, doi = {10.4230/LIPIcs.GIScience.2023.36}, annote = {Keywords: Urban expansion, morphology, spatio-temporal dynamics, simulation, compactness} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, and Huacheng Yu. Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 52:1-52:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chen_et_al:LIPIcs.ICALP.2021.52, author = {Chen, Lijie and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R. and Song, Zhao and Yu, Huacheng}, title = {{Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {52:1--52:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.52}, URN = {urn:nbn:de:0030-drops-141218}, doi = {10.4230/LIPIcs.ICALP.2021.52}, annote = {Keywords: streaming algorithms, random walk sampling} }
Published in: LIPIcs, Volume 116, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Ryan O'Donnell and Yu Zhao. On Closeness to k-Wise Uniformity. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 54:1-54:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{odonnell_et_al:LIPIcs.APPROX-RANDOM.2018.54, author = {O'Donnell, Ryan and Zhao, Yu}, title = {{On Closeness to k-Wise Uniformity}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {54:1--54:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-085-9}, ISSN = {1868-8969}, year = {2018}, volume = {116}, editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.54}, URN = {urn:nbn:de:0030-drops-94581}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.54}, annote = {Keywords: k-wise independence, property testing, Fourier analysis, Boolean function} }
Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)
Irvan Jahja, Haifeng Yu, and Yuda Zhao. Some Lower Bounds in Dynamic Networks with Oblivious Adversaries. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jahja_et_al:LIPIcs.DISC.2017.29, author = {Jahja, Irvan and Yu, Haifeng and Zhao, Yuda}, title = {{Some Lower Bounds in Dynamic Networks with Oblivious Adversaries}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.29}, URN = {urn:nbn:de:0030-drops-79690}, doi = {10.4230/LIPIcs.DISC.2017.29}, annote = {Keywords: dynamic networks, oblivious adversary, adaptive adversary, lower bounds, communication complexity} }
Published in: LIPIcs, Volume 50, 31st Conference on Computational Complexity (CCC 2016)
Ryan O'Donnell and Yu Zhao. Polynomial Bounds for Decoupling, with Applications. In 31st Conference on Computational Complexity (CCC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 50, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{odonnell_et_al:LIPIcs.CCC.2016.24, author = {O'Donnell, Ryan and Zhao, Yu}, title = {{Polynomial Bounds for Decoupling, with Applications}}, booktitle = {31st Conference on Computational Complexity (CCC 2016)}, pages = {24:1--24:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-008-8}, ISSN = {1868-8969}, year = {2016}, volume = {50}, editor = {Raz, Ran}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.24}, URN = {urn:nbn:de:0030-drops-58520}, doi = {10.4230/LIPIcs.CCC.2016.24}, annote = {Keywords: Decoupling, Query Complexity, Fourier Analysis, Boolean Functions} }
Feedback for Dagstuhl Publishing