Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems
Author :
Publisher :
Page : 394 pages
File Size : 36,97 MB
Release : 2005
Category : Computer science
ISBN :
Author :
Publisher :
Page : 394 pages
File Size : 36,97 MB
Release : 2005
Category : Computer science
ISBN :
Author : Louisiana) ACM-SIAM Symposium on Discrete Algorithms (24th : 2013 : New Oreleans
Publisher :
Page : 1915 pages
File Size : 18,98 MB
Release : 2013-05-21
Category : Computers
ISBN : 9781611972511
Author :
Publisher : SIAM
Page : 532 pages
File Size : 25,72 MB
Release : 1993-01-01
Category : Mathematics
ISBN : 9780898713138
Annotation Proceedings of a conference that took place in Austin, Texas in January 1993. Contributors are impressive names from the field of computer science, including Donald Knuth, author of several computer books of "biblical" importance. The diverse selection of paper topics includes dynamic point location, ray shooting, and the shortest paths in planar maps; optimistic sorting and information theoretic complexity; and an optimal randomized algorithm for the cow-path problem. No index. Annotation copyright by Book News, Inc., Portland, OR.
Author :
Publisher :
Page : 804 pages
File Size : 23,76 MB
Release : 1992
Category : Computable functions
ISBN :
Author : João Gama
Publisher : Springer Science & Business Media
Page : 486 pages
File Size : 12,31 MB
Release : 2007-10-11
Category : Computers
ISBN : 3540736786
Processing data streams has raised new research challenges over the last few years. This book provides the reader with a comprehensive overview of stream data processing, including famous prototype implementations like the Nile system and the TinyOS operating system. Applications in security, the natural sciences, and education are presented. The huge bibliography offers an excellent starting point for further reading and future research.
Author : Chun-Cheng Lin
Publisher : Springer Nature
Page : 398 pages
File Size : 33,54 MB
Release : 2023-03-13
Category : Computers
ISBN : 3031270517
This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.
Author : David Simplot-Ryl
Publisher : Springer Science & Business Media
Page : 247 pages
File Size : 41,67 MB
Release : 2012-03-23
Category : Computers
ISBN : 3642290957
This volume constitutes the refereed proceedings of the Third International ICST Conference, ADHOCNETS 2011, held in Paris, France, in September 2011. The 15 revised full papers - selected from 42 submissions - and the 2 invited papers cover several fundamental aspects of ad hoc networking, including security, quality of service, radio and spectrum analysis, mobility, energy efficiency, and deployment. They are organized in topical sections on security and QoS, WSN development and evaluation, radio and spectrum analysis, mobile WSNs, mobile ad hoc networks, and energy.
Author : Michael W. Berry
Publisher : SIAM
Page : 556 pages
File Size : 38,68 MB
Release : 2004-01-01
Category : Mathematics
ISBN : 9780898715682
The Fourth SIAM International Conference on Data Mining continues the tradition of providing an open forum for the presentation and discussion of innovative algorithms as well as novel applications of data mining. This is reflected in the talks by the four keynote speakers who discuss data usability issues in systems for data mining in science and engineering, issues raised by new technologies that generate biological data, ways to find complex structured patterns in linked data, and advances in Bayesian inference techniques. This proceedings includes 61 research papers.
Author : Der-tsai Lee
Publisher : World Scientific
Page : 411 pages
File Size : 15,96 MB
Release : 1993-11-22
Category : Computers
ISBN : 9814502855
In the past two decades, research in VLSI physical design has been directed toward automation of layout process. Since the cost of fabricating a circuit is a fast growing function of the circuit area, circuit layout techniques are developed with an aim to produce layouts with small areas. Other criteria of optimality such as delay and via minimization need to be taken into consideration. This book includes 14 articles that deal with various stages of the VLSI layout problem. It covers topics including partitioning, floorplanning, placement, global routing, detailed routing and layout verification. Some of the chapters are review articles, giving the state-of-the-art of the problems related to timing driven placement, global and detailed routing, and circuit partitioning. The rest of the book contains research articles, giving recent findings of new approaches to the above-mentioned problems. They are all written by leading experts in the field. This book will serve as good references for both researchers and professionals who work in this field.
Author : Ilario Bonacina
Publisher : Springer
Page : 137 pages
File Size : 13,22 MB
Release : 2018-01-11
Category : Computers
ISBN : 3319734539
This book considers logical proof systems from the point of view of their space complexity. After an introduction to propositional proof complexity the author structures the book into three main parts. Part I contains two chapters on resolution, one containing results already known in the literature before this work and one focused on space in resolution, and the author then moves on to polynomial calculus and its space complexity with a focus on the combinatorial technique to prove monomial space lower bounds. The first chapter in Part II addresses the proof complexity and space complexity of the pigeon principles. Then there is an interlude on a new type of game, defined on bipartite graphs, essentially independent from the rest of the book, collecting some results on graph theory. Finally Part III analyzes the size of resolution proofs in connection with the Strong Exponential Time Hypothesis (SETH) in complexity theory. The book is appropriate for researchers in theoretical computer science, in particular computational complexity.