Filters








199 Hits in 13.6 sec

Theory and Practice of Bloom Filters for Distributed Systems

Sasu Tarkoma, Christian Esteve Rothenberg, Eemil Lagerspetz
<span title="">2012</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b4kxurpz5vbn7gog6wq32vliii" style="color: black;">IEEE Communications Surveys and Tutorials</a> </i> &nbsp;
In this survey, we give an overview of the basic and advanced techniques, reviewing over 20 variants and discussing their application in distributed systems, in particular for caching, peer-to-peer systems  ...  This has been reflected in recent research and many new algorithms have been proposed for distributed systems that are either directly or indirectly based on Bloom filters.  ...  ACKNOWLEDGEMENTS This work was supported by TEKES as part of the Future Internet program of TIVIT (Finnish Strategic Centre for Science, Technology and Innovation in the field of ICT).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/surv.2011.031611.00024">doi:10.1109/surv.2011.031611.00024</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ziz4fwmd5jhizjvjpltaejhnmy">fatcat:ziz4fwmd5jhizjvjpltaejhnmy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120813034300/http://www.dca.fee.unicamp.br:80/~chesteve/pubs/bloom-filter-ieee-survey-preprint.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8d/d5/8dd55802ca52cb74aad86254edc3f2722cff8f4b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/surv.2011.031611.00024"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A survey of sketches in traffic measurement: Design, Optimization, Application and Implementation [article]

Shangsen Li, Lailong Luo, Deke Guo, Qianzhen Zhang, Pengtao Fu
<span title="2021-07-20">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Due to the massive, speedy, unpredictable features of network flows, sketches are widely implemented in measurement nodes to approximately record the frequency or estimate the cardinality of flows.  ...  To summarize the existing efforts, we carry out an in-depth study of the existing literature, covering more than 90 sketch designs and optimization strategies.  ...  Sliding HLL [77] improves HLL for stream processing by adding a sliding window mechanism.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2012.07214v2">arXiv:2012.07214v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lme2ghsshje3tag2m5q3xgvcna">fatcat:lme2ghsshje3tag2m5q3xgvcna</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210722112128/https://arxiv.org/pdf/2012.07214v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/21/c0/21c04d5cb3e486a19c95ba68f9e8787aa06ce695.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2012.07214v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

An Introduction to Sensor Data Analytics [chapter]

Charu C. Aggarwal
<span title="2012-12-28">2012</span> <i title="Springer US"> Managing and Mining Sensor Data </i> &nbsp;
At t i = 7, the window slides and now contains raw sensor values v 3j , . . . , v 6j .  ...  Since functions are employed for approximating data segments, only the approximated data segments are stored in the database, instead of the raw sensor values of the data stream [64, 50].  ...  or the U.S.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4614-6309-2_1">doi:10.1007/978-1-4614-6309-2_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pfbx566yfzgqpnjcuzonmxr23q">fatcat:pfbx566yfzgqpnjcuzonmxr23q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150206104149/http://charuaggarwal.net:80/sensortoc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4614-6309-2_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Getting It All from the Crowd [article]

Beth Trushkowsky, Tim Kraska, Michael J. Franklin, Purnamrita Sarkar
<span title="2012-02-10">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Furthermore query progress monitoring becomes difficult due to non-uniformities in the arrival of crowdsourced data and peculiarities of how people work in crowdsourcing systems.  ...  Hybrid human/computer systems promise to greatly expand the usefulness of query processing by incorporating the crowd for data gathering and other tasks.  ...  This work was inspired by the CrowdDB project, and we would like to thank our CrowdDB collaborators Donald Kossmann, Sukriti Ramesh, and Reynold Xin.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1202.2335v1">arXiv:1202.2335v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rbybqcd7mvddlojkt5bcli5jxe">fatcat:rbybqcd7mvddlojkt5bcli5jxe</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1202.2335/1202.2335.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c9/86/c986638996b44c7d42554fb6b271278f856ed07a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1202.2335v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches

Graham Cormode
<span title="">2011</span> <i title="Now Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/waqifvssrfedlidcnrqddey6ki" style="color: black;">Foundations and Trends in Databases</a> </i> &nbsp;
Methods for Approximate Query Processing (AQP) are essential for dealing with massive data.  ...  Picking the B largest HWT coefficients results in a synopsis that provides the optimal L 2 (sum-squared) error for the reconstructed data.  ...  Acknowledgments The work of Minos Garofalakis was partially supported by the European Commission under FP7-FET Open (Future and Emerging Technologies) ICT-2009.8.0 grant no. 255957 (LIFT).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1561/1900000004">doi:10.1561/1900000004</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wk7razxkmzcv7fzczftlohblwa">fatcat:wk7razxkmzcv7fzczftlohblwa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160923003149/http://db.cs.berkeley.edu/cs286/papers/synopses-fntdb2012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e5/6b/e56ba953f0498d66b2b7dd5d351c35876b62ef11.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1561/1900000004"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Element Distinctness, Frequency Moments, and Sliding Windows [article]

Paul Beame, Raphael Clifford, Widad Machmouchi
<span title="2013-09-14">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We further exhibit a quantum algorithm for F_0 over sliding windows with T in O(n^3/2/S^1/2). Finally, we consider the computations of order statistics over sliding windows.  ...  We complement this lower bound with a T in O(n^2/S) comparison-based deterministic RAM algorithm for exactly computing F_k over sliding windows, nearly matching both our lower bound for the sliding-window  ...  Acknowledgements The authors would like to thank Aram Harrow, Ely Porat and Shachar Lovett for a number of insightful discussions and helpful comments during the preparation of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1309.3690v1">arXiv:1309.3690v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3ypzlfgfqzhjvgbw7yfdlruyrq">fatcat:3ypzlfgfqzhjvgbw7yfdlruyrq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200910025731/https://arxiv.org/pdf/1309.3690v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9e/2e/9e2e8e29e4c4b6eb16458c4b4fa9c13c6b170a45.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1309.3690v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Data Mining Techniques for Wireless Sensor Networks: A Survey

Azhar Mahmood, Ke Shi, Shaheen Khatoon, Mi Xiao
<span title="">2013</span> <i title="SAGE Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/snvb3djywzbhvjtue42hxtjery" style="color: black;">International Journal of Distributed Sensor Networks</a> </i> &nbsp;
Recently, data management and processing for wireless sensor networks (WSNs) has become a topic of active research in several fields of computer science, such as the distributed systems, the database systems  ...  Based on the limitations of the existing technique, an adaptive data mining framework of WSNs for future research is proposed.  ...  in the current sliding window.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/406316">doi:10.1155/2013/406316</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wdrq5vffqbcylcdqvqinx4vjui">fatcat:wdrq5vffqbcylcdqvqinx4vjui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810174232/http://vahabonline.com/wp-content/uploads/2014/10/Data-Mining-Techniques-for.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b8/47/b8471ec8fd257799107b802f989ac8ea79b32f7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/406316"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

On Approximation Algorithms for Data Mining Applications [chapter]

Foto N. Afrati
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We aim to present current trends in the theoretical computer science research on topics which have applications in data mining. We briefly describe data mining tasks in various application contexts.  ...  We give an overview of some of the questions and algorithmic issues that are of concern when mining huge amounts of data that do not fit in main memory.  ...  Acknowledgements: Thanks to Chen Li and Ioannis Milis for reading and providing comments in an earlier version of this chapter.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11671541_1">doi:10.1007/11671541_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g2nm45u545audjojlxh6a7zpzu">fatcat:g2nm45u545audjojlxh6a7zpzu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170517081140/http://users.softlab.ntua.gr:80/facilities/public/AD/foto/dm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b0/7f/b07f486544595f0c130cba718d1ecb65bee37bf8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11671541_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Crawler [chapter]

Kenneth A. Ross, Christian S. Jensen, Richard Snodgrass, Curtis E. Dyreson, Christian S. Jensen, Richard Snodgrass, Spiros Skiadopoulos, Cristina Sirangelo, Mary Lynette Larsgaard, Gösta Grahne, Daniel Kifer, Hans-Arno Jacobsen (+106 others)
<span title="">2009</span> <i title="Springer US"> Encyclopedia of Database Systems </i> &nbsp;
Synonyms Cache-aware query processing; Cache-sensitive query processing Definition Query processing algorithms are designed to efficiently exploit the available cache units in the memory hierarchy.  ...  For such workloads, improving the locality of data-intensive operations can have a direct impact on the system's overall performance.  ...  Clustering on Streams C381 C Sliding Windows A popular model of stream analysis is the sliding window model, which introduces a new parameter W.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-39940-9_2315">doi:10.1007/978-0-387-39940-9_2315</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x4qspjdytvhvroc7h753dihp7u">fatcat:x4qspjdytvhvroc7h753dihp7u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110310202218/https://www.cs.indiana.edu/~yuqwu/DBgroup/papers/2009-EODS-Compu-complete-Query-Lang.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-39940-9_2315"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

FastEtch: A Fast Sketch-based Assembler for Genomes

Priyanka Ghosh, Ananth Kalyanaraman
<span title="">2018</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q75ftrlivrhrnno5ijjuyufx5a" style="color: black;">IEEE/ACM Transactions on Computational Biology &amp; Bioinformatics</a> </i> &nbsp;
The algorithm uses Count-Min sketch, which is a probabilistic data structure for streaming data sets.  ...  In this paper, we present a fast algorithm, FastEtch, that uses sketching to build an approximate version of the de Bruijn graph for the purpose of generating an assembly.  ...  However, the Bloom filter is suited for membership queries. In the case of genome assembly, in addition to membership, the frequency of kmers also becomes important.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcbb.2017.2737999">doi:10.1109/tcbb.2017.2737999</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/28910776">pmid:28910776</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6yttdozncjdmzcliby3dr5xg5a">fatcat:6yttdozncjdmzcliby3dr5xg5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218134438/http://pdfs.semanticscholar.org/0bf7/95de934ed9a0d9a411640ec2572c05e2fee9.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0b/f7/0bf795de934ed9a0d9a411640ec2572c05e2fee9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcbb.2017.2737999"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

The user attribution problem and the challenge of persistent surveillance of user activity in complex networks

Claudio Taglienti, James Cannady
<span title="2016-04-19">2016</span> <i title="IOS Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/spxf4rshtfhgvoxv3apocfge6m" style="color: black;">Journal of Computer Security</a> </i> &nbsp;
What was not anticipated prior to this research was the very high degree of repetitiveness of some web destinations found in real network data.  ...  In the context of telecommunication networks, the user attribution problem refers to the challenge faced in recognizing communication traffic as belonging to a given user when information needed to identify  ...  Table 26 Appendix H -Calibrations Alternate Markov Based Approaches with Real Network Data  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3233/jcs-160546">doi:10.3233/jcs-160546</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/csumqyxqqvhwncgklmrxukhizq">fatcat:csumqyxqqvhwncgklmrxukhizq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190429034620/https://nsuworks.nova.edu/cgi/viewcontent.cgi?article=1318&amp;context=gscis_etd" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/20/68/2068b9f3e8da7c46f609fe73e91802916a9c49af.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3233/jcs-160546"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A scalable sparse Cholesky based approach for learning high-dimensional covariance matrices in ordered data

Kshitij Khare, Sang-Yun Oh, Syed Rahman, Bala Rajaratnam
<span title="2019-06-04">2019</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h4nnd7sxwzcwhetu5qkjbcdh6u" style="color: black;">Machine Learning</a> </i> &nbsp;
Acknowledgment We have been fortunate to have our colleagues and collaborators give us their impressions and contributions toward the contents of this book. We would like to  ...  Given a string σ, its q-grams are obtained by "sliding" a window of length q over the characters of σ.  ...  In addition, the software features a built-in query optimizer for fast data retrieval.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10994-019-05810-5">doi:10.1007/s10994-019-05810-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nulmjvxvwjgojfoe2ywv3pjrpu">fatcat:nulmjvxvwjgojfoe2ywv3pjrpu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200313095338/https://escholarship.org/content/qt9nk7p1c6/qt9nk7p1c6.pdf?t=ptnt4v" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/ed/daeda01695c266d404199cfa7a05f113e2c89e38.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10994-019-05810-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Design of large polyphase filters in the Quadratic Residue Number System

Gian Carlo Cardarilli, Alberto Nannarelli, Yann Oster, Massimo Petricca, Marco Re
<span title="">2010</span> <i title="IEEE"> 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers </i> &nbsp;
a region of interest in a speech stream or by speaking the query term.  ...  Washington University A simple alternative to the sliding window algorithms for turbo decoding is presented.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/acssc.2010.5757589">doi:10.1109/acssc.2010.5757589</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ccxnu5owr5fyrcjcqukumerueq">fatcat:ccxnu5owr5fyrcjcqukumerueq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722035510/http://www.asilomarssc.org/asil10/prog10/BookAbstracts.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/65/1f/651f669659be4f5528bc05c7017312e4c03acc81.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/acssc.2010.5757589"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Surveillance on Manycasting Over Optical Burst Switching (OBS) Networks under Secure Sparse Regeneration

C.Veera lakshmi
<span title="">2013</span> <i title="IOSR Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uuksgv35krdo3h6hiyizxfpbee" style="color: black;">IOSR Journal of Electronics and Communication Engineering</a> </i> &nbsp;
Manycasting is a communication paradigm to implement the distributed applications. In manycasting, destinations can join or exit the group, depending on the service requirements imposed on them.  ...  This dynamic movement of the destinations in the group decreases blocking effect.  ...  Also the author would like to thank reviewers for their valuable comments to improve the quality of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/2834-0460108">doi:10.9790/2834-0460108</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5qasfbq4n5cbpln42h3pa3cucq">fatcat:5qasfbq4n5cbpln42h3pa3cucq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130916164037/http://iosrjournals.org/iosr-jece/full-issue/vol4-issue6.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/d5/c1d5c1106027686a70655b28d58fe38fae7c632a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.9790/2834-0460108"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Entity Retrieval and Text Mining for Online Reputation Monitoring [article]

Pedro Saleiro
<span title="2018-01-23">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Therefore, we address the problem of Entity-Relationship (E-R) retrieval in which the goal is to search for multiple connected entities.  ...  In practice, current ORM methods are constrained to the generation of data analytics reports, which aggregate statistics of popularity and sentiment on social media.  ...  Fig. 6. 2 2 Training and testing sliding window -first 2 iterations. bursty patterns.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1801.07743v1">arXiv:1801.07743v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f56lljaavnd6zm4vnngs2m3tga">fatcat:f56lljaavnd6zm4vnngs2m3tga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191017135431/https://arxiv.org/pdf/1801.07743v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ff/fc/fffc938c2b36d2a8b9493d133c1fa79b7f743d72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1801.07743v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 199 results