Items related to Searching in non-overlapping Neighbor ranges on Plane...
Synopsis
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 detected. The proposed method tries to improve the plane sweep algorithm by efficiently calculating the minimal group of words and enumerating intervals in a document which contain the minimum frequency keyword. It decreases the number of comparison and creates the best state of optimized search algorithm especially in a high volume of data. Efficiency and reliability are also increased compared to the previous modes of the technical approach.
"synopsis" may belong to another edition of this title.
About the Author
Elahe moghimi hanjani: received her B.Sc. in computer engineering from Azad University central Tehran branch, Tehran, IRAN, in 2008, and received her M.Sc. degree in computer engineering in Payam Noor University (PNU),in 2012,Tehran,IRAN.
"About this title" may belong to another edition of this title.
Buy New
View this item
US$ 43.40
US$ 26.99 shipping from Germany to U.S.A.
Destination, rates & speedsSearch results for Searching in non-overlapping Neighbor ranges on Plane...
Seller Image
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Published by
LAP LAMBERT Academic Publishing Mrz 2013, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 detected. The proposed method tries to improve the plane sweep algorithm by efficiently calculating the minimal group of words and enumerating intervals in a document which contain the minimum frequency keyword. It decreases the number of comparison and creates the best state of optimized search algorithm especially in a high volume of data. Efficiency and reliability are also increased compared to the previous modes of the technical approach. 60 pp. Englisch. Seller Inventory # 9783659367236
Quantity: 2 available
Seller Image
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Published by
LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Moghimi Hanjani ElaheElahe moghimi hanjani: received her B.Sc. in computer engineering from Azad University central Tehran branch, Tehran, IRAN, in 2008, and received her M.Sc. degree in computer engineering in Payam Noor University. Seller Inventory # 5151491
Quantity: Over 20 available
Seller Image
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Published by
LAP LAMBERT Academic Publishing Mär 2013, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware -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 detected. The proposed method tries to improve the plane sweep algorithm by efficiently calculating the minimal group of words and enumerating intervals in a document which contain the minimum frequency keyword. It decreases the number of comparison and creates the best state of optimized search algorithm especially in a high volume of data. Efficiency and reliability are also increased compared to the previous modes of the technical approach.Books on Demand GmbH, Überseering 33, 22297 Hamburg 60 pp. Englisch. Seller Inventory # 9783659367236
Quantity: 2 available
Seller Image
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Published by
LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 detected. The proposed method tries to improve the plane sweep algorithm by efficiently calculating the minimal group of words and enumerating intervals in a document which contain the minimum frequency keyword. It decreases the number of comparison and creates the best state of optimized search algorithm especially in a high volume of data. Efficiency and reliability are also increased compared to the previous modes of the technical approach. Seller Inventory # 9783659367236
Quantity: 1 available