Verwandte Artikel zu Searching in non-overlapping Neighbor ranges on Plane...
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
Biografía del autor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 87,05
EUR 29,35 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 31,27
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Searching in non-overlapping Neighbor ranges on Plane...
Foto des Verkäufers
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Verlag:
LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
Neu
Softcover
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 5151491
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Verlag:
LAP LAMBERT Academic Publishing Mär 2013, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783659367236
Anzahl: 2 verfügbar
Foto des Verkäufers
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Verlag:
LAP LAMBERT Academic Publishing Mrz 2013, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783659367236
Anzahl: 2 verfügbar
Foto des Verkäufers
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Verlag:
LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783659367236
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Searching in Non-Overlapping Neighbor Ranges on Plane Sweep Algorithm
Verlag:
VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
Neu
Softcover
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 60. Bestandsnummer des Verkäufers 18128812351
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Searching in Non-Overlapping Neighbor Ranges on Plane Sweep Algorithm
Verlag:
VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
Neu
Softcover
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 60. Bestandsnummer des Verkäufers 26128812341
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Searching in Non-Overlapping Neighbor Ranges on Plane Sweep Algorithm
Verlag:
VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
Neu
Softcover
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 131742442
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Searching in non-overlapping Neighbor ranges on Plane Sweep Algorithm
Verlag:
LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659367230
ISBN 13: 9783659367236
Gebraucht
Paperback
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: Like New. Like New. book. Bestandsnummer des Verkäufers ERICA75836593672306
Anzahl: 1 verfügbar