AN ALGORITHM FOR OPTIMIZED SEARCHING USING NON-OVERLAPPING
ITERATIVE NEIGHBOR INTERVALS
E. a. International Journal of Computer Science, Engineering and Applications (IJCSEA), 2 (5):
12(October 2012)
DOI: 10.5121/ijcsea.2012.2505
Abstract
We have attempted in this paper to reduce the number of checked condition through saving frequency of the tandem replicated words, and also using non-overlapping iterative neighbor intervals on plane sweep algorithm. The essential idea of non-overlapping iterative neighbor search in a document lies in focusing the search not on the full space of solutions but on a smaller subspace considering non-overlapping intervals defined by the solutions
%0 Journal Article
%1 noauthororeditor
%A a, Elahe Moghimi Hanjani
%D 2012
%J International Journal of Computer Science, Engineering and Applications (IJCSEA)
%K Partial Plane Proximity Replicated algorithm data retrieval search searchText sweep
%N 5
%P 12
%R 10.5121/ijcsea.2012.2505
%T AN ALGORITHM FOR OPTIMIZED SEARCHING USING NON-OVERLAPPING
ITERATIVE NEIGHBOR INTERVALS
%U http://airccse.org/journal/ijcsea/papers/2512ijcsea05.pdf
%V 2
%X We have attempted in this paper to reduce the number of checked condition through saving frequency of the tandem replicated words, and also using non-overlapping iterative neighbor intervals on plane sweep algorithm. The essential idea of non-overlapping iterative neighbor search in a document lies in focusing the search not on the full space of solutions but on a smaller subspace considering non-overlapping intervals defined by the solutions
@article{noauthororeditor,
abstract = {We have attempted in this paper to reduce the number of checked condition through saving frequency of the tandem replicated words, and also using non-overlapping iterative neighbor intervals on plane sweep algorithm. The essential idea of non-overlapping iterative neighbor search in a document lies in focusing the search not on the full space of solutions but on a smaller subspace considering non-overlapping intervals defined by the solutions},
added-at = {2019-05-18T07:13:28.000+0200},
author = {a, Elahe Moghimi Hanjani},
biburl = {https://www.bibsonomy.org/bibtex/290e1f73c5f1eda116bdf7c742a8d0592/ijcsea},
doi = {10.5121/ijcsea.2012.2505},
interhash = {9a15601d4c317b1ad8b9596fbd0fe0bf},
intrahash = {90e1f73c5f1eda116bdf7c742a8d0592},
journal = {International Journal of Computer Science, Engineering and Applications (IJCSEA)},
keywords = {Partial Plane Proximity Replicated algorithm data retrieval search searchText sweep},
month = {October},
number = 5,
pages = 12,
timestamp = {2019-05-23T07:23:02.000+0200},
title = {AN ALGORITHM FOR OPTIMIZED SEARCHING USING NON-OVERLAPPING
ITERATIVE NEIGHBOR INTERVALS},
url = {http://airccse.org/journal/ijcsea/papers/2512ijcsea05.pdf},
volume = 2,
year = 2012
}