Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Hilmi Yildirim
@inproceedings{DBLP:conf/icsoc/FahndrichMYA13, author = {Johannes F{\"{a}}hndrich and Nils Masuch and Hilmi Yildirim and Sahin Albayrak}, editor = {Alessio Lomuscio and Surya Nepal and Fabio Patrizi and Boualem Benatallah and Ivona Brandic}, title = {Towards Automated Service Matchmaking and Planning for Multi-Agent Systems with {OWL-S} - Approach and Challenges}, booktitle = {Service-Oriented Computing - {ICSOC} 2013 Workshops - CCSA, CSB, PASCEB, SWESE, WESOA, and PhD Symposium, Berlin, Germany, December 2-5, 2013. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8377}, pages = {240--247}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-06859-6\_21}, doi = {10.1007/978-3-319-06859-6\_21}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icsoc/FahndrichMYA13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1301-0977, author = {Hilmi Yildirim and Vineet Chaoji and Mohammed J. Zaki}, title = {{DAGGER:} {A} Scalable Index for Reachability Queries in Large Dynamic Graphs}, journal = {CoRR}, volume = {abs/1301.0977}, year = {2013}, url = {http://arxiv.org/abs/1301.0977}, eprinttype = {arXiv}, eprint = {1301.0977}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1301-0977.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/vldb/YildirimCZ12, author = {Hilmi Yildirim and Vineet Chaoji and Mohammed J. Zaki}, title = {{GRAIL:} a scalable index for reachability queries in very large graphs}, journal = {{VLDB} J.}, volume = {21}, number = {4}, pages = {509--534}, year = {2012}, url = {https://doi.org/10.1007/s00778-011-0256-4}, doi = {10.1007/S00778-011-0256-4}, timestamp = {Sat, 19 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/vldb/YildirimCZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/us/Yildirim11, author = {Hilmi Yildirim}, title = {Scalable reachability indexing for very large graphs}, school = {Rensselaer Polytechnic Institute, {USA}}, year = {2011}, url = {https://hdl.handle.net/20.500.13015/3398}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/us/Yildirim11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sdm/ChaojiLYZ11, author = {Vineet Chaoji and Geng Li and Hilmi Yildirim and Mohammed Javeed Zaki}, title = {{ABACUS:} Mining Arbitrary Shaped Clusters from Large Datasets based on Backbone Identification}, booktitle = {Proceedings of the Eleventh {SIAM} International Conference on Data Mining, {SDM} 2011, April 28-30, 2011, Mesa, Arizona, {USA}}, pages = {295--306}, publisher = {{SIAM} / Omnipress}, year = {2011}, url = {https://doi.org/10.1137/1.9781611972818.26}, doi = {10.1137/1.9781611972818.26}, timestamp = {Sat, 19 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sdm/ChaojiLYZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pvldb/YildirimCZ10, author = {Hilmi Yildirim and Vineet Chaoji and Mohammed Javeed Zaki}, title = {{GRAIL:} Scalable Reachability Index for Large Graphs}, journal = {Proc. {VLDB} Endow.}, volume = {3}, number = {1}, pages = {276--284}, year = {2010}, url = {http://www.vldb.org/pvldb/vldb2010/pvldb\_vol3/R24.pdf}, doi = {10.14778/1920841.1920879}, timestamp = {Sat, 19 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pvldb/YildirimCZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icde/YildirimZ10, author = {Hilmi Yildirim and Mohammed Javeed Zaki}, title = {Graph indexing for reachability queries}, booktitle = {Workshops Proceedings of the 26th International Conference on Data Engineering, {ICDE} 2010, March 1-6, 2010, Long Beach, California, {USA}}, pages = {321--324}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/ICDEW.2010.5452724}, doi = {10.1109/ICDEW.2010.5452724}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icde/YildirimZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdm/HasanYC10, author = {Mohammad Al Hasan and Hilmi Yildirim and Abhirup Chakraborty}, editor = {Geoffrey I. Webb and Bing Liu and Chengqi Zhang and Dimitrios Gunopulos and Xindong Wu}, title = {{SONNET:} Efficient Approximate Nearest Neighbor Using Multi-core}, booktitle = {{ICDM} 2010, The 10th {IEEE} International Conference on Data Mining, Sydney, Australia, 14-17 December 2010}, pages = {719--724}, publisher = {{IEEE} Computer Society}, year = {2010}, url = {https://doi.org/10.1109/ICDM.2010.157}, doi = {10.1109/ICDM.2010.157}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icdm/HasanYC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/recsys/YildirimK08, author = {Hilmi Yildirim and Mukkai S. Krishnamoorthy}, editor = {Pearl Pu and Derek G. Bridge and Bamshad Mobasher and Francesco Ricci}, title = {A random walk method for alleviating the sparsity problem in collaborative filtering}, booktitle = {Proceedings of the 2008 {ACM} Conference on Recommender Systems, RecSys 2008, Lausanne, Switzerland, October 23-25, 2008}, pages = {131--138}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1454008.1454031}, doi = {10.1145/1454008.1454031}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/recsys/YildirimK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.