![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Communication-Efficient Distributed Multiple Reference Pattern Matching for M2M Systems"
@inproceedings{DBLP:conf/icdm/WangLYLG13, author = {Jui{-}Pin Wang and Yu{-}Chen Lu and Mi{-}Yen Yeh and Shou{-}De Lin and Phillip B. Gibbons}, title = {Communication-Efficient Distributed Multiple Reference Pattern Matching for {M2M} Systems}, booktitle = {2013 {IEEE} 13th International Conference on Data Mining, Dallas, TX, USA, December 7-10, 2013}, pages = {787--796}, year = {2013}, crossref = {DBLP:conf/icdm/2013}, url = {https://doi.org/10.1109/ICDM.2013.161}, doi = {10.1109/ICDM.2013.161}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icdm/WangLYLG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/icdm/2013, editor = {Hui Xiong and George Karypis and Bhavani Thuraisingham and Diane J. Cook and Xindong Wu}, title = {2013 {IEEE} 13th International Conference on Data Mining, Dallas, TX, USA, December 7-10, 2013}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://ieeexplore.ieee.org/xpl/conhome/6724379/proceeding}, isbn = {978-0-7695-5108-1}, timestamp = {Tue, 03 Sep 2024 21:33:45 +0200}, biburl = {https://dblp.org/rec/conf/icdm/2013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.