| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 60
reviews
|
|
|
 |
|
|
|
|
Using dense storage to solve small sparse linear systems
Morandini M., Mantegazza P. ACM Transactions on Mathematical Software 33(1): 5-es, 2007. Type: Article
Linear systems of equations are used in many areas of engineering, science, and business. These systems may have thousands, even millions, of equations, but usually only a very small number of unknowns are used in one equation. Solving...
|
May 30 2007 |
|
|
|
|
|
|
Asymmetry in k-center variants
Li Gørtz I., Wirth A. Theoretical Computer Science 361(2): 188-199, 2006. Type: Article
Consider a set of n cities and the distances between each pair of cities. The k-center problem consists of choosing a set of k cities, called centers, so that the sum of distances from each city to the nearest cent...
|
Jan 9 2007 |
|
|
|
|
|
|
Computational oriented matroids
Bokowski J., Cambridge University Press, New York, NY, 2005. 338 pp. Type: Book (9780521849302)
Bokowski’s book is an excellent, informative, and competent monograph on oriented matroids addressed to mathematicians and computer scientists....
|
Nov 15 2006 |
|
|
|
|
|
|
Equitable colorings of bounded treewidth graphs
Bodlaender H., Fomin F. Theoretical Computer Science 349(1): 22-30, 2005. Type: Article
Bodlaender and Fomin prove that an equitable k-coloring can be found in polynomial time on graphs of bounded treewidth. It follows that an l-bounded k-coloring also has a polynomial solution on graphs of bounded tr...
|
Jul 10 2006 |
|
|
|
|
|
|
Finding 3-shredders efficiently
Hegde R. ACM Transactions on Algorithms 2(1): 14-43, 2006. Type: Article
A k-shredder in an undirected graph is a vertex cut of size k whose removal results in at least three components. The author presents a linear algorithm to find the set of 3-shredders in a 3-connected graph. The algorithm...
|
Jun 20 2006 |
|
|
|
|
|
|
 The Turing triage test
Sparrow R. Ethics and Information Technology 6(4): 203-213, 2004. Type: Article
In the well-known Turing test, a judge exchanges messages through teletype with a man and a computer, and must decide who is who. The point is that the contestants are not visible to the judge and the only way to unravel their identiti...
|
Feb 2 2006 |
|
|
|
|
|
|
Automatic cell placement for quantum-dot cellular automata
Ravichandran R., Lim S., Niemier M. Integration, the VLSI Journal 38(3): 541-548, 2005. Type: Article
Ravichandran, Lim, and Niemier develop the first cell-level placement of quantum-dot cellular automata (QCA) circuits to help automate the design process. QCA placement proceeds in three steps: zone partitioning, zone placement, and ce...
|
Aug 17 2005 |
|
|
|
|
|
|
Handbook of exact string matching algorithms
Charras C., Lecroq T., King’s College Publications, 2004. 238 pp. Type: Book (9780954300647)
String matching has a wide variety of uses, both within computer science and in computer applications from business to science. This book covers string matching in 40 short chapters. After an introductory chapter, each succeeding chapt...
|
Jul 21 2005 |
|
|
|
|
|
|
Computer science handbook (2nd ed.)
Tucker A., Chapman & Hall/CRC, Toronto, ON, 2004. 2752 pp. Type: Book (9781584883609), Reviews: (1 of 2)
This majestic tome, of over 2,700 pages, is an overview of computer science, divided into 11 sections, according to Computing Curricula 2001 [1]. The handbook includes 110 chapters, written by over 150 authors....
|
Mar 11 2005 |
|
|
|
|
|
|
Reasoning processes in humans and computers: theory and research in psychology and artificial intelligence
Wagman M., Greenwood Publishing Group Inc., Westport, CT, 2003. 320 pp. Type: Book (9780275975258)
A long description of an experiment concerning conditions to reduce fallacious reasoning begins this book (the didactic correction fared better than self-contradiction). Examples of the difficulty, even inadequacy, of mathematically mo...
|
Jan 19 2005 |
|
|
|
|
|
| |
|
|
| |
|
|
