You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
"Graphs. Such a simple idea. Map a problem onto a graph then solve it by searching over the graph or by exploring the structure of the graph. What could be easier? Turns out, however, that working with graphs is a vast and complex field. Keeping up is challenging. To help keep up, you just need an editor who knows most people working with graphs, and have that editor gather nearly 70 researchers to summarize their work with graphs. The result is the book Massive Graph Analytics." — Timothy G. Mattson, Senior Principal Engineer, Intel Corp Expertise in massive-scale graph analytics is key for solving real-world grand challenges from healthcare to sustainability to detecting insider threats, cyber defense, and more. This book provides a comprehensive introduction to massive graph analytics, featuring contributions from thought leaders across academia, industry, and government. Massive Graph Analytics will be beneficial to students, researchers, and practitioners in academia, national laboratories, and industry who wish to learn about the state-of-the-art algorithms, models, frameworks, and software in massive-scale graph analytics.
This volume comprises papers dedicated to data science and the extraction of knowledge from many types of data: structural, quantitative, or statistical approaches for the analysis of data; advances in classification, clustering and pattern recognition methods; strategies for modeling complex data and mining large data sets; applications of advanced methods in specific domains of practice. The contributions offer interesting applications to various disciplines such as psychology, biology, medical and health sciences; economics, marketing, banking and finance; engineering; geography and geology; archeology, sociology, educational sciences, linguistics and musicology; library science. The book contains the selected and peer-reviewed papers presented during the European Conference on Data Analysis (ECDA 2013) which was jointly held by the German Classification Society (GfKl) and the French-speaking Classification Society (SFC) in July 2013 at the University of Luxembourg.
Euro-Par 2005 was the eleventh conference in the Euro-Par series. It was organized by the Centre for Informatics and Information Technology (CITI) and the Department of Informatics of the Faculty of Science and Technology of Universidade Nova de Lisboa, at the Campus of Monte de Caparica.
This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.
This volume contains the papers presented at the International Workshop on Internet and Network Economics held during December 17–20, 2008, in Sha- hai, China, for its fourth edition. WINE 2008 provided a forum for researchers from di?erent disciplines to communicate with each other and exchange their researching ?ndings in this emerging ?eld. WINE 2008hadteninvitedspeakers:FanChungGraham,MatthewJackson, Lawrence Lau, Tom Luo, Eric Maskin, Paul Milgrom, Christos Papadimitriou, Herbert Scarf, Hal Varian and Yinyu Ye. There were 126 submissions. Each submission was reviewed on average by 2. 5 Programme Committee members. The Committee decided to accept 68 papers. The programme also included ...
The two-volume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010. The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6198 contains 60 contributions of track A selected from 222 submissions as well as 2 invited talks.
Concurrent and parallel systems are intrinsic to the technology which underpins almost every aspect of our lives today. This book presents the combined post-proceedings for two important conferences on concurrent and parallel systems: Communicating Process Architectures 2017, held in Sliema, Malta, in August 2017, and Communicating Process Architectures 2018, held in Dresden, Germany, in August 2018. CPA 2017: Fifteen papers were accepted for presentation and publication, they cover topics including mathematical theory, programming languages, design and support tools, verification, and multicore infrastructure and applications ranging from supercomputing to embedded. A workshop on domain-spe...
In this proceedings volume we provide a compilation of article contributions equally covering applications from different research fields and ranging from capacity up to capability computing. Besides classical computing aspects such as parallelization, the focus of these proceedings is on multi-scale approaches and methods for tackling algorithm and data complexity. Also practical aspects regarding the usage of the HPC infrastructure and available tools and software at the SCC are presented.
Annotation This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010.The 77 revised full papers presented were carefully reviewed and selected from 182 submissions for inclusion in the book. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; computational geometry; graph coloring; fixed parameter tractability; optimization; online algorithm; and scheduling.