Magdy amr (33 resultados)

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Condición: New. In English.

Condición: New.

Condición: New. In English.

Condición: New.

Condición: New. pp. XXI, 111 61 illus., 15 illus. in color. 1st ed. 2020 edition NO-PA16APR2015-KAP.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New.

Hardcover. Condición: Brand New. 136 pages. 9.25x6.10x0.47 inches. In Stock.

Condición: New.

Taschenbuch. Condición: Neu. Discovering Clusters of Arbitrary Shapes and Densities in Data Streams | A density-based and grid-based approach to discover clusters in data streams | Amr Magdy (u. a.) | Taschenbuch | 116 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783846524343 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.…

Condición: New. pp. 192.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The huge size of a continuously flowing data has put forward a number of challenges in data stream analysis. Exploration of the structure of streamed data represented a major challenge that resulted in introducing various clustering algorithms. However, current clustering algorithms still lack the ability to efficiently discover clusters of arbitrary densities in data streams. In this thesis, a new grid-based and density-based algorithm is proposed for clustering data streams. It addresses drawbacks of recent algorithms in discovering clusters of arbitrary densities. The algorithm uses an online component to map the input data to grid cells. An offline component is then used to cluster the grid cells based on density information. Relative density relatedness measures and a dynamic range neighborhood are proposed to differentiate clusters of arbitrary densities. The experimental evaluation shows considerable improvements upon the state-of-the-art algorithms in both clustering quality and scalability with different stream sizes and with higher dimensions. In addition, the output quality of the proposed algorithm is less sensitive to parameter selection errors. 116 pp. Englisch.…

Condición: New. Print on Demand pp. XXI, 111 61 illus., 15 illus. in color.

Condición: New. Print on Demand.

Condición: New. Print on Demand.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Magdy AmrAmr Magdy has finished his M.Sc. degree in Computer and System Engineering in Alexandria University, Egypt under supervision of Prof. Dr. Nagwa M. El-Makky and Assistant Prof. Noha A. Yousri. Their research interests include.…

Condición: New. PRINT ON DEMAND pp. XXI, 111 61 illus., 15 illus. in color.

Condición: New. PRINT ON DEMAND.

Condición: New. PRINT ON DEMAND.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents an innovative, easy to execute, way for evaluating power consumption on a high-level of abstractionIntroduces a practical methodology for modeling power consumption, using existing design flowsTransaction Level Modeling is used as a .…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents an innovative, easy to execute, way for evaluating power consumption on a high-level of abstractionIntroduces a practical methodology for modeling power consumption, using existing design flowsTransaction Level Modeling is used as a .…

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - E-Learning is now a major issue to the world. However, there are challenges facing interactive e- learning environments; Like the available bandwidth and the need for Real-Time communication. According to these and other challenges, the system performance should be analyzed deeply. Interactive e-learning environment, to be most effective, should provide different components and tools that allow different types of interaction between speaker and attendees. Creation and integration between all required components is not trivial as different privileges are granted to different users. To create such rich environment, technologies used should be selected carefully to satisfy real time and learning environment constraints. For instance, a streaming server is a must to stream audio/video and other data to all attendees simultaneously. Client components are preferred to be compatible with the server not to waste resources. With integrated clients and server, we could build an interactive environment; providing the required functionality and interactivity.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Kabardy AmrAmr Kabardy, RA in Microsoft Innovation Lab in Cairo, received B.Sc with honors in Computer & Systems Engineering from Alex. University, Egypt on 2008 where he later worked as TA. His graduation project (with Amr Magdy..…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The huge size of a continuously flowing data has put forward a number of challenges in data stream analysis. Exploration of the structure of streamed data represented a major challenge that resulted in introducing various clustering algorithms. However, current clustering algorithms still lack the ability to efficiently discover clusters of arbitrary densities in data streams. In this thesis, a new grid-based and density-based algorithm is proposed for clustering data streams. It addresses drawbacks of recent algorithms in discovering clusters of arbitrary densities. The algorithm uses an online component to map the input data to grid cells. An offline component is then used to cluster the grid cells based on density information. Relative density relatedness measures and a dynamic range neighborhood are proposed to differentiate clusters of arbitrary densities. The experimental evaluation shows considerable improvements upon the state-of-the-art algorithms in both clustering quality and scalability with different stream sizes and with higher dimensions. In addition, the output quality of the proposed algorithm is less sensitive to parameter selection errors.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 116 pp. Englisch.…