Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings
Product Description
This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully r… More >>
Posted by Praney Behl Date: Saturday, August 7, 2010
Categories: Computer Science
Tags: 14th, 1517, 2003, Algorithms, Computation, December, International, ISAAC, Japan, Kyoto, Proceedings, Symposium
Design of Hashing Algorithms
Product Description
This work presents recent developments in hashing algorithm design. Hashing is the process of creating a short digest (i.e., 64 bits) for a message of arbitrary length, for exam- ple 20 Mbytes. Hashing algorithms wer… More >>
Posted by Praney Behl Date: Monday, August 2, 2010
Categories: Computer Science
Tags: Algorithms, Design, Hashing
Stochastic Algorithms: Foundations and Applications: Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings
Product Description
This book constitutes the refereed proceedings of the Second International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2003, held in Hatfield, UK in September 2003. The 12 revised full papers p… More >>
Posted by Praney Behl Date: Thursday, July 29, 2010
Categories: Computer Science
Tags: 2003, 2223, Algorithms, Applications, Foundations, Hatfield, International, Proceedings, SAGA, Second, September, stochastic, Symposium
Resource Allocation in Wireless Networks: Theory and Algorithms
Product Description
The wireless industry is in the midst of a fundamental shift from providing voice-only services to offering customers an array of multimedia services, including a wide variety of audio, video and data communications capa… More >>
Resource Allocation in Wireless Networks: Theory and Algorithms
Posted by Praney Behl Date: Tuesday, July 27, 2010
Categories: Computer Science
Tags: Algorithms, Allocation, Networks, Resource, Theory, Wireless
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Product Description
Following Karmarkar’s 1984 linear programming algorithm, numerous interior-point algorithms have been proposed for various mathematical programming problems such as linear programming, convex quadratic… More >>
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Posted by Praney Behl Date: Saturday, July 17, 2010
Categories: Computer Science
Tags: Algorithms, Approach, Complementarity, Interior, Linear, Point, Problems, Unified
Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative
Product Description
Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the aim of encouraging collabor… More >>
Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative
Posted by Praney Behl Date: Thursday, July 15, 2010
Categories: Computer Science
Tags: Algorithms, Data, efficient, Final, Initiative, Joint, Report, Special, Structures
Algorithms – ESA ‘93: First Annual European Symposium, Bad Honnef, Germany, September 30 – October 2, 1993. Proceedings
Product Description
Symposium on Algorithms (ESA ‘93), held in Bad Honnef, near Boon, in Germany, September 30 – October 2, 1993. The symposium is intended to launchan annual series of international conferences, held in early fall… More >>
Posted by Praney Behl Date: Wednesday, July 7, 2010
Categories: Computer Science
Tags: 1993, Algorithms, Annual, European, First, Germany, Honnef, October, Proceedings, September, Symposium
Algorithms for Random Generation and Counting: A Markov Chain Approach
Product Description
This monograph studies two classical computational problems: counting the elements of a finite set of combinatorial structures, and generating them at random from some probability distribution. Apart from their intrinsic… More >>
Algorithms for Random Generation and Counting: A Markov Chain Approach
Posted by Praney Behl Date: Sunday, June 13, 2010
Categories: Computer Science
Tags: Algorithms, Approach, Chain, Counting, Generation, Markov, Random
The Design and Analysis of Algorithms
Product Description
The design and analysis of algorithms is one of the two essential cornerstone topics in computer science (the other being automata theory/theory of computation). Every computer scientist has a copy of Knuth’s works on al… More >>
Posted by Praney Behl Date: Saturday, May 29, 2010
Categories: Computer Science
Tags: Algorithms, Analysis, Design
Primality Testing in Polynomial Time: From Randomized Algorithms to “PRIMES Is in P”
Product Description
This book treats algorithms for the venerable “primality problem”: Given a natural number n, decide whether it is prime or composite. The problem is basic in number theory; efficient algorithms that solve it, i.e., algor… More >>
Primality Testing in Polynomial Time: From Randomized Algorithms to “PRIMES Is in P”
Posted by Praney Behl Date: Wednesday, May 26, 2010
Categories: Computer Science
Tags: Algorithms, from, Polynomial, Primality, PRIMES, Randomized, Testing, Time










