Описание: Algorithms and Applications for Academic Search, Recommendation and Quantitative Association Rule Mining presents novel algorithms for academic search, recommendation and association rule mining that have been developed and optimized for different commercial as well as academic purpose systems. Along with the design and implementation of algorithms, a major part of the work presented in the book involves the development of new systems both for commercial as well as for academic use. In the first part of the book the author introduces a novel hierarchical heuristic scheme for re-ranking academic publications retrieved from standard digital libraries. The scheme is based on the hierarchical combination of a custom implementation of the term frequency heuristic, a time-depreciated citation score and a graph-theoretic computed score that relates the paper’s index terms with each other. In order to evaluate the performance of the introduced algorithms, a meta-search engine has been designed and developed that submits user queries to standard digital repositories of academic publications and re-ranks the top-n results using the introduced hierarchical heuristic scheme. In the second part of the book the design of novel recommendation algorithms with application in different types of e-commerce systems are described. The newly introduced algorithms are a part of a developed Movie Recommendation system, the first such system to be commercially deployed in Greece by a major Triple Play services provider. The initial version of the system uses a novel hybrid recommender (user, item and content based) and provides daily recommendations to all active subscribers of the provider (currently more than 30,000). The recommenders that we are presenting are hybrid by nature, using an ensemble configuration of different content, user as well as item-based recommenders in order to provide more accurate recommendation results.The final part of the book presents the design of a quantitative association rule mining algorithm. Quantitative association rules refer to a special type of association rules of the form that antecedent implies consequent consisting of a set of numerical or quantitative attributes. The introduced mining algorithm processes a specific number of user histories in order to generate a set of association rules with a minimally required support and confidence value. The generated rules show strong relationships that exist between the consequent and the antecedent of each rule, representing different items that have been consumed at specific price levels. This research book will be of appeal to researchers, graduate students, professionals, engineers and computer programmers.
Автор: Andrej Brodnik; Alejandro Lopez-Ortiz; Venkatesh R Название: Space-Efficient Data Structures, Streams, and Algorithms ISBN: 3642402720 ISBN-13(EAN): 9783642402722 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: ГЇВїВЅ This Festschrift volume, published in honor of J. Ian Munro, presents a good overall perspective of the last 40 years of research in algorithms and data structures. It also explores the future prospects in algorithm research.
Автор: Burkhard Monien; Thomas Ottmann Название: Data Structures and Efficient Algorithms ISBN: 3540554882 ISBN-13(EAN): 9783540554882 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains a series of research papers which address fundamental data structures, computational geometry, graph algorithms, computer graphics, spatial databases, the design of parallel architectures and routeing strategies and the design of distributed algorithms for solving problems.
Автор: Shukla KK Название: Efficient Algorithms for Discrete Wavelet Transform ISBN: 1447149408 ISBN-13(EAN): 9781447149408 Издательство: Springer Рейтинг: Цена: 5589.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Due to its inherent time-scale locality characteristics, the discrete wavelet transform (DWT) has received considerable attention in signal/image processing. In the multistage DWT, coefficients are calculated recursively, and in addition to the wavelet decomposition stage, extra space is required to store the intermediate coefficients.
Автор: Gibbons Название: Efficient Parallel Algorithms ISBN: 0521388414 ISBN-13(EAN): 9780521388412 Издательство: Cambridge Academ Рейтинг: Цена: 7602.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: An introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelization. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics.
Описание: IntroductionAlgorithmic ComplexityA Crash Course in LispEssential Data StructuresArraysLinked ListsKey-ValuesDerivative Data StructuresTreesGraphsStringsSelected AlgorithmsApproximationCompressionSynchronizationAfterword
Описание: This book constitutes the thoroughly refereed post-conference proceedings of the International Dagstuhl-Seminar on Efficient Algorithms for Global Optimization Methods in Computer Vision, held in Dagstuhl Castle, Germany, in November 2011.
Автор: Lu?s Filipe Ros?rio Lucas; Eduardo Ant?nio Barros Название: Efficient Predictive Algorithms for Image Compression ISBN: 3319511793 ISBN-13(EAN): 9783319511795 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book discusses efficient prediction techniques for the current state-of-the-art High Efficiency Video Coding (HEVC) standard, focusing on the compression of a wide range of video signals, such as 3D video, Light Fields and natural images.
Описание: Data structures allow organizing data efficiently. Their suitable implementation can provide a complete solution that acts like reusable code. In this book, you will learn how to use various data structures while developing in the C# language as well as how to implement some of the most common algorithms used with such data structures.
Описание: Integer linear programming is a versatile modeling and optimization technique with potential to transform biological computation. This hands-on text, designed for students, researchers, and professionals in both biology and computational fields, demonstrates applications in genomics, RNA and protein folding, DNA sequencing, phylogenetics, and more.
Описание: SLS methods include a wide spectrum of te- niques, ranging from constructive search procedures and iterative improvement algorithms to more complex SLS methods, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search, and variable neighborhood search.
