Items related to Searching in non-overlapping Neighbor ranges on Plane...

Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm - Softcover

 
9783659367236: Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm

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 Used

Condition: As New
Like New
View this item

£ 8 shipping within United Kingdom

Destination, rates & speeds

Buy New

View this item

£ 9.38 shipping from Germany to United Kingdom

Destination, rates & speeds

Search results for Searching in non-overlapping Neighbor ranges on Plane...

Seller Image

Elahe Moghimi Hanjani
ISBN 10: 3659367230 ISBN 13: 9783659367236
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

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

Contact seller

Buy New

£ 31.54
Convert currency
Shipping: £ 9.38
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 2 available

Add to basket

Seller Image

Elahe Moghimi Hanjani
Published by LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659367230 ISBN 13: 9783659367236
New Taschenbuch
Print on Demand

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

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

Contact seller

Buy New

£ 31.54
Convert currency
Shipping: £ 11.93
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Moghimi Hanjani, Elahe
ISBN 10: 3659367230 ISBN 13: 9783659367236
New Softcover
Print on Demand

Seller: Majestic Books, Hounslow, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Print on Demand pp. 60 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Seller Inventory # 131742442

Contact seller

Buy New

£ 43.18
Convert currency
Shipping: £ 3.35
Within United Kingdom
Destination, rates & speeds

Quantity: 4 available

Add to basket

Seller Image

Elahe Moghimi Hanjani
Published by LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659367230 ISBN 13: 9783659367236
New Softcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

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

Contact seller

Buy New

£ 27.47
Convert currency
Shipping: £ 21.31
From Germany to United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Moghimi Hanjani, Elahe
ISBN 10: 3659367230 ISBN 13: 9783659367236
New Softcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. pp. 60. Seller Inventory # 26128812341

Contact seller

Buy New

£ 42.57
Convert currency
Shipping: £ 6.61
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Moghimi Hanjani, Elahe
ISBN 10: 3659367230 ISBN 13: 9783659367236
New Softcover
Print on Demand

Seller: Biblios, Frankfurt am main, HESSE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. PRINT ON DEMAND pp. 60. Seller Inventory # 18128812351

Contact seller

Buy New

£ 46.96
Convert currency
Shipping: £ 6.78
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 4 available

Add to basket

Seller Image

Elahe Moghimi Hanjani
ISBN 10: 3659367230 ISBN 13: 9783659367236
New Taschenbuch

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

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

Contact seller

Buy New

£ 31.54
Convert currency
Shipping: £ 29.85
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Moghimi Hanjani, Elahe
Published by LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659367230 ISBN 13: 9783659367236
Used Paperback

Seller: Mispah books, Redhill, SURRE, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA75836593672306

Contact seller

Buy Used

£ 72
Convert currency
Shipping: £ 8
Within United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket