Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Elahe Moghimi Hanjani
Broschiertes Buch

Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm

Versandfertig in 6-10 Tagen
24,99 €
inkl. MwSt.
PAYBACK Punkte
12 °P sammeln!
We have attempted 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. Subspace is defined by the range near the specified minimum keyword. We repeatedly pick a range up and flip the unsatisfied keywords, so the relevant ranges are detec...