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.
Filters
August 2016 VOLUME 5, ISSUE 8, AUGUST 2016 5th Generation Wi-Fi Shatha Ghazal, Raina S Alkhlailah Abstract | PDF with Text | DOI: 10.17148/IJARCCE.2016.5801 ECG Arrhythmia Detection Using Choi-Williams Time-Frequency Distribution and Artificial Neural Network Sanjit K. Dash, G. Sasibhushana Rao Abstract | PDF with Text | DOI: 10.17148/IJARCCE.2016.5802 Data Security using RSA Algorithm in Cloud Computing Santosh Kumar Singh, Dr. P.K. Manjhi, Dr. R.K. Tiwari Abstract | PDF with Text | DOI: 10.17148/IJARCCE.2
...
2016
IJARCCE
Preserved Fulltext
This paper discussed query terms with semantic search for retrieval of web content using different semantic indexing techniques. ...
This would increase precision and recall for the semantic search when compared to traditional search. ...
The lack of efficient indexing method is still a major problem to information retrieval system. ...
doi:10.17148/ijarcce.2016.5869
fatcat:ihbu5ekllnhqjbuw6yeetnin3q
Page 9266 of Mathematical Reviews Vol. , Issue 2001M
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We present a simple and efficient algorithm for match- ing regular expressions with texts, using full inverted text. ...
The sec- ond one, named Index-Index, selects a set of entries of the full inverted text. This set contains the points of departure for algo- rithms applied to full inverted text. ...
Cryptography On Android Message Application Using Look Up Table And Dynamic Key (Cama)
2012
IOSR Journal of Computer 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 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose an efficient algorithm for cryptography which is based on static Look Up table and Dynamic Key. Symmetric encryption and decryption is used in this algorithm. ...
Most popular shortest and cheapest textual form of communication is short message service (SMS).To ensure the security of the texts which is sent, many algorithm are available. ...
In Table 1 , algorithm for encryption of message is explained. Step 4: To each character in static text add key recursively and get dynamic text. ...
doi:10.9790/0661-0625459
fatcat:jjwzeyepgbcbzeccwuf4rfcqfe
Subject Index
2005
Journal of Discrete Algorithms
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.
An exact and polynomial distance-based algo-
rithm to reconstruct single copy tandem dupli-
cation trees, 362
Text databases
Indexing text with approximate q-grams, 157
Time complexity
Improving ...
approximate patterns, 293
Duplication trees
An exact and polynomial distance-based algo-
rithm to reconstruct single copy tandem dupli-
cation trees, 362
Dynamic algorithm
Partially dynamic maintenance ...
doi:10.1016/s1570-8667(05)00042-0
fatcat:phytlwupp5hmtddg3ffue5546u
Subject Index
2003
Journal of Discrete Algorithms
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.
, 423 Ziv-Lempel compression Approximate string matching on Ziv-Lempel compressed text, 313 NP-complete problem
An efficient fixed-parameter algorithm for 3-Hit-
ting Set, 89
d-cycle problem
Algorithms ...
for shortest paths and d-cycle prob-
lems, 1
2-spanner
A PTAS for the sparsest 2-spanner of 4-connected
planar triangulations, 67
3-Hitting Set
An efficient fixed-parameter algorithm for 3-Hit-
ting ...
doi:10.1016/s1570-8667(03)00075-3
fatcat:icg7if3uingibmjwy2mjud4rwe
Dynamic Requirement Clustering of Requirement with Usable Test Cases by Cosine-Correlation
2015
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 2018; you can also visit the original URL.
The file type is application/pdf.
Here we purposed an approach for dynamic clustering for test cases and requirement. ...
Component based software development gained a lot of practical importance in the field of Software engineering by the academic researcher and industry for finding reusable efficient test cases. ...
Enhance the work by dynamic counting the threshold by using Exception-Maximization algorithm and use adaptive method for threshold optimization. ...
doi:10.5120/ijca2015905594
fatcat:dxtl7vnw6bepter4wo6us4todi
Collecting Valuable Information from Fast Text Streams
[chapter]
2014
IFIP Advances in Information and Communication Technology
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 indexes for the whole query base. ...
It has become a challenging work to collect valuable information from fast text streams. In this work, we propose a method which gains useful information effectively and efficiently. ...
Algorithm 1. Dynamically update the Trie Input: Given an empty or already existed Trie trie and query set qset. Output: An updated trie and maximum length N in the query base. 1. ...
doi:10.1007/978-3-662-44980-6_11
fatcat:obxmgq5hu5fk5fvnue4y7qhxtm
Dynamic 2D Dictionary Matching in Small Space
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Our algorithm is suitable for rectangular patterns that are of uniform size in one dimension. ...
This article presents the first algorithm that performs dynamic dictionary matching on two-dimensional data within small space. The time complexity of our algorithm is almost linear. ...
In the following sections, we describe first an algorithm for patterns in which the rows are highly periodic and then an algorithm for all other patterns. ...
arXiv:1302.0072v1
fatcat:tj4mdp3e6jd6dhxns62vatl6oe
A Partial String Matching Approach for Named Entity Recognition in Unstructured Bengali Data
2018
International Journal of Modern Education and Computer 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 2018; you can also visit the original URL.
The file type is application/pdf.
This has been an active research topic for more than two decades and significant progresses have been made. ...
The algorithm is a partial string matching technique, based on Breadth First Search (BFS) search on a Trie data structure, augmented with dynamic programming. ...
This paper makes the following contributions: An efficient technique has been proposed based on dynamic programming to solve the problem of NER in a closed domain. An optimized implementation of this ...
doi:10.5815/ijmecs.2018.01.04
fatcat:oboura3kj5e4navtfzcjdkoqh4
Analysis and architecture for memory efficient JBIG2 arithmetic encoder
2005
48th Midwest Symposium on Circuits and Systems, 2005.
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.
The experimental results show that the proposed algorithms are efficient. The proposed algorithms can reduce the memory requirements for the contexts by 98.7%. ...
This paper addresses the problem of large memory requirements for the contexts. The arithmetic encoders of text region in JBIG2 require a large memory for the contexts. ...
Moreover, the AE involves many bit-level operations, which are not suitable for processors. Therefore, hardware acceleration of the AE is an efficient way to implement the JBIG2 system. ...
doi:10.1109/mwscas.2005.1594320
fatcat:gnm7gy5vs5et3dcszwt5g6otyq
Update Query Time Trade-off for dynamic Suffix Arrays
[article]
2020
arXiv
pre-print
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.
The suffix array is one of the most well known indexing data structures, and it functions as a key tool in many string algorithms. ...
For every 0 ≤ε≤ 1, our data structure reports SA[i] in Õ(n^ε) time and handles text modification in Õ(n^1-ε) time. ...
Their algorithm can be de-amortized to aÕ( √ n) time for text update andÕ(m √ n) time for an indexing query. ...
arXiv:2007.06604v1
fatcat:gkj64aeatnem7bdrxtvfabscui
Incremental on-line semantic indexing for image retrieval in dynamic databases
2009
2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
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 propose an on-line incremental semantic indexing scheme for image retrieval in dynamic image collections. ...
Contemporary approaches to semantic indexing for bag of words image retrieval do not adapt well when the image or video collections dynamically get modified. ...
One needs an on-line, incremental, efficient and scalable method of semantic indexing to deal with such data. ...
doi:10.1109/cvpr.2009.5204246
fatcat:svobwwmxanh6dnwss2qqioy7we
Incremental on-line semantic indexing for image retrieval in dynamic databases
2009
2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
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 propose an on-line incremental semantic indexing scheme for image retrieval in dynamic image collections. ...
Contemporary approaches to semantic indexing for bag of words image retrieval do not adapt well when the image or video collections dynamically get modified. ...
One needs an on-line, incremental, efficient and scalable method of semantic indexing to deal with such data. ...
doi:10.1109/cvprw.2009.5204246
dblp:conf/cvpr/KarthikPJ09
fatcat:vwuvjh23lndexizxcjtsbhpfue
Study of Dynamic Multikeyword Text Search Techniques over Encrypted Data in Cloud
2017
International Journal of Advanced Research in Computer Science and Software 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.
Suppose, a large number of users that are on cloud and large number of documents on cloud, Its important for the service provider to allow multi-keyword query and provided the result that meet efficient ...
requirements for such a secure cloud data utilization system to become a reality. ...
In the proposed work the drawback of K-Mean clustering may be removed for an efficient search algorithm. ...
doi:10.23956/ijarcsse/v7i7/0110
fatcat:dktyjor7szchjpva4ahqlgcmce
A New Indexing Technique for Information Retrieval Systems Using Rhetorical Structure Theory (RST)
2006
Journal of Computer 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 2018; you can also visit the original URL.
The file type is application/pdf.
Effective information retrieval requires an efficient indexing technique. ...
The nodes of Rhetorical Parsing tree contain relations and text spans which can be used for indexing by indexer. The results are promising for different texts. ...
Due to the ability of RST to define coherence relations very formally and elaborately makes motivate to develop an algorithm for reorganizations of relations and to use these relations for Indexing. ...
doi:10.3844/jcssp.2006.224.228
fatcat:fah5jeowmnc7xexvdam7rafdfu
« Previous
Showing results 1 — 15 out of 136,282 results