A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Tool For Fast Detection Of Java Code Snippets
2014
Zenodo
Preserved Fulltext
A number of solutions for all of these tasks have been proposed in the literature. However, although that all these solutions are really fast, they compare just the constant static trees. ...
We used several optimizations to achieve very low number of comparisons during the matching algorithm. ...
Although this approach speeded up the process, however, it is necessary to say that this applies just for further runs. In the case of the first runs, compilation of sources takes a lot of time. ...
doi:10.5281/zenodo.1096686
fatcat:6opmpclsy5gutlaxdu6vlophga
Scripting Language for Java Source Code Recognition
2014
Information Engineering Research Institute procedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements This work is supported by the SGS11/167/OHK4/3T/14 grant of the Ministry of Education, Youth and Sports of the Czech Republic. ...
Although this approach speeded up the process, however, it is necessary to say that this applies just for further runs. In the case of the first runs, compilation of sources takes a lot of time. ...
(Fig. 2. ) But the left and right indexes signalizes that the "main" node does have just one child, however, we search for a method with 4 statements. ...
doi:10.1016/j.ieri.2014.09.100
fatcat:2mdf5feldnc5rg4jhd45m36vvu
Using inertial sensors to index into video
2012
Procedia Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The event type and timing information derived from the inertial sensor data can be stored and used as search keys for specific events in the video. ...
One of the issues with using video is searching the video data to look for specific events to examine. ...
As an example application given in section 3, the client can search for the 42 nd stroke in a tennis match and display the video for just that stroke. ...
doi:10.1016/j.proeng.2012.04.102
fatcat:yn3qv7um4fa53clqkjawfoczyu
Triple Indexing: An Efficient Technique for Fast Phrase Query Evaluation
2014
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a new technique called Triple Indexing to index web documents which optimizes query evaluation time for phrase queries by reducing the time for merging the posting lists and checking ...
Phrase query evaluation is an important task of every search engine. Optimizing the query evaluation time for phrase queries is the biggest threat for the current search engine. ...
In other words, the triple index stores phrases of length up to 3 words. Why Triple Indexing? According to Zhang et al. [15] the average query length is just 2.4 words. ...
doi:10.5120/15266-3970
fatcat:3e42wiv7l5ea5d44givrwdzz34
Searching and mining trillions of time series subsequences under dynamic time warping
2012
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work we show that by using a combination of four novel ideas we can search and mine truly massive time series for the first time. ...
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series data mining algorithms. ...
In future work we plan to revisit algorithms for time series motif discovery [25] [26] , anomaly detection [35] [31], time series summarization, shapelet extraction [39] , clustering, and classification ...
doi:10.1145/2339530.2339576
pmid:31660254
pmcid:PMC6816304
fatcat:imnrg5y3q5hwrjt5u5xaaxk55e
Reorganizing compressed text
2008
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Moreover, the reordered compressed text becomes an implicitly indexed representation of the text, which can be searched for words in time independent of the text length. ...
That is, we achieve not only fast sequential search time, but indexed search time, for almost no extra space cost. ...
to speed up sequential search for words and phrases. ...
doi:10.1145/1390334.1390360
dblp:conf/sigir/BrisaboaFLN08
fatcat:dgors6fxajdepeetyj5g2stwgm
Compression: a key for next-generation text retrieval systems
2000
Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this article we discuss recent methods for compressing the text and the index of text retrieval systems. ...
Most surprisingly, the time required to build the index and also to answer a query is much less than if the index and text had not been compressed. ...
Acknowledgements We wish to acknowledge the many comments of Berthier Ribeiro-Neto and Wagner Meira Jr that helped us to improve this article. ...
doi:10.1109/2.881693
fatcat:joqfo66ltngc7cyaayejlk26cu
Specialized Search Engines - Searching big data with high-speed
2018
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Build your tools to efficiently reach the goal. Complex products are not always the best answer. OS tools are very powerful: use them. ...
After that, it was possible to make a search for records containing a specific email address in a few seconds. ...
Elastic scales well, but requires more code to keep data under control and more hardware. In addition, the search engine was just a PoC, so we didn't want go big in hardware. ...
doi:10.5281/zenodo.3521900
fatcat:bh35ubyr6rbo5jq5jhns4zdm24
Reprint of: The anatomy of a large-scale hypertextual web search engine
2012
Computer Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. ...
Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce ...
Acknowledgments Scott Hassan and Alan Steremberg have been critical to the development of Google. Their talented contributions are irreplaceable, and the authors owe them much gratitude. ...
doi:10.1016/j.comnet.2012.10.007
fatcat:a3qmfmrc4bgsbdbt5ugvdavcyq
Operational requirements for scalable search systems
2003
Proceedings of the twelfth international conference on Information and knowledge management - CIKM '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We use response time, throughput, and utilization as the key operational characteristics for evaluating performance. ...
In this paper, we present a framework based upon queuing network theory for analyzing search systems in terms of operational requirements. ...
In this section, we examine two such strategies: first, speeding up the existing architecture; and second, altering the architecture via partitioning of the search index. ...
doi:10.1145/956943.956945
fatcat:xn6msn74obajdkarv7ds2qhh2m
Classy Delicates: A Case Study
2011
Journal of Business Case Studies (JBCS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
"We should consider a sale of the business seriously," said Julia, "even though you were thinking of upgrading the site to improve traffic." "How much time do we have to examine the offers?" ...
Andy Steiner was checking the Internet for late night West Coast baseball game scores early on Saturday morning, August 3rd, 2007, when an email message popped up on his screen. ...
Classy Delicates was not my full-time job; I had my academic job to attend to and Julia had just taken up a new job when we moved to New Jersey. ...
doi:10.19030/jbcs.v6i5.897
fatcat:4l4leetuczcmrcfm5kjewi4m34
Operational requirements for scalable search systems
2003
Proceedings of the twelfth international conference on Information and knowledge management - CIKM '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We use response time, throughput, and utilization as the key operational characteristics for evaluating performance. ...
In this paper, we present a framework based upon queuing network theory for analyzing search systems in terms of operational requirements. ...
In this section, we examine two such strategies: first, speeding up the existing architecture; and second, altering the architecture via partitioning of the search index. ...
doi:10.1145/956863.956945
dblp:conf/cikm/ChowdhuryP03
fatcat:6n55cbp5pzgjhph6bkekimripu
The freshness of web search engine databases
2006
Journal of information science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In terms of indexing patterns, we find different approaches at the different engines: While MSN shows clear update patterns, Google shows some outliers and the update process of the Yahoo index seems to ...
This study measures the frequency in which search engines update their indices. Therefore, 38 websites that are updated on a daily basis were analysed within a time-span of six weeks. ...
Users looking for current information will find it only if the search engine's index is up to date. ...
doi:10.1177/0165551506062326
fatcat:leggfvshbrhhhen6gbupdat2xi
High Throughput Short Read Alignment via Bi-directional BWT
2009
2009 IEEE International Conference on Bioinformatics and Biomedicine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show a new indexing data structure called bi-directional BWT, which allows us to build the fastest software for aligning short reads. ...
When compared with existing software (Bowtie is the best), our software is at least 3 times faster for finding unique best alignments, and 25 times faster for finding all possible alignments. ...
ACKNOWLEDGEMENT The project is partially supported by Hong Kong RGC Grant HKU7140/064. ...
doi:10.1109/bibm.2009.42
dblp:conf/bibm/LamLTWWY09
fatcat:prausjgobffh5hv54o6ux5xgdu
Chisel
2006
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
-Solution is to search the table for the longest matching prefix, then back up to shorter prefixes until a real match is found. -Worst-case performance is hard to predict. ...
-Authors propose storing the entire key to eliminate false positives. • To avoid wasting space, they suggest storing pointers in the Index Wildcards Again • The scheme just described only works for a single ...
A Few Caveats • Only useful for routing. -Combining all of these components to deal with multiple fields would be a nightmare. ...
doi:10.1145/1150019.1136503
fatcat:7xanxukjgzdihlpr64bj47oqra
« Previous
Showing results 1 — 15 out of 508,555 results