| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 32
reviews
|
|
|
 |
|
|
|
|
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 19352004
Bar-Yehuda R., Bendel K., Freund A., Rawitz D. ACM Computing Surveys 36(4): 422-463, 2004. Type: Article
The authors describe this survey as a small textbook, and I agree wholeheartedly. But, it is a textbook summarizing about 80 related papers in 41 pages, so the interested reader is required to read it slowly, and with a lot of thought....
|
Mar 8 2005 |
|
|
|
|
|
|
Packing Steiner trees with identical terminal sets
Kaski P. Information Processing Letters 91(1): 1-5, 2004. Type: Article
The classical problem on optimum Steiner trees has spawned various related problems. The Steiner tree packing problem is one. In the abstract, it can be defined as follows: one is given an undirected graph and k sets...
|
Jan 21 2005 |
|
|
|
|
|
|
 Complete solution classification for the perspective-three-point problem
Gao X., Hou X., Tang J., Cheng H. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(8): 930-943, 2003. Type: Article
The perspective problem (also called pose estimation) is defined as follows: given n points in space, and the values of the angles subtended by each pair of points at an unknown “point of view,“ d...
|
Jan 19 2005 |
|
|
|
|
|
|
Tile invariants: new horizons
Pak I. Theoretical Computer Science 303(2-3): 303-331, 2003. Type: Article
The tiling problem can best be described by thinking of the problem of covering a checkerboard with dominoes. One can generalize the problem by allowing other shapes of the board, changing it to have infinite dimensions, allowing for h...
|
Feb 24 2004 |
|
|
|
|
|
|
An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded
Thiant N. Theoretical Computer Science 303(2-3): 353-374, 2003. Type: Article
A figure made of square tiles can be considered to be colored in the style of a checkerboard. The figure is said to be balanced when the number of white and black squares are equal (a property which is obviously independent of which of...
|
Nov 4 2003 |
|
|
|
|
|
|
Sorting algorithms for broadcast communications: mathematical analysis
Grabner P., Prodinger H. Theoretical Computer Science 289(1): 51-67, 2002. Type: Article
The use of distributed databases and Internet communication has many of the features of parallel processing, so can be expected to yield faster algorithms for problems than those yielded by serial computation. The authors have analyzed...
|
Jul 22 2003 |
|
|
|
|
|
|
Graphs and enhancing Maple multiplication
Cecil D. Mathematics and Computer Education 36(1): 62-69, 2002. Type: Article
The transitive closure of a relation exhibited by a finite graph can be determined by repetitive multiplication of the Boolean matrix representing the relation. A more efficient method is the use of the Warshall algorithm (referenced i...
|
Jun 4 2003 |
|
|
|
|
|
|
Rotation invariant texture features and their use in automatic script identification
Tan T. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(7): 751-756, 1998. Type: Article
Tan quotes evidence from cortical channel studies that Gabor functions can be used as features for texture recognition. The Gabor filters are not rotation-invariant, while most textures are. The author has developed...
|
Sep 1 1998 |
|
|
|
|
|
|
Computation of $sqrt {{x mathord{left/ {vphantom {x d}}
ight. kern-
ulldelimiterspace} d}}$ in a Very High Radix Combined Division/Square-Root Unit with Scaling and Selection by Rounding
Antelo E., Lang T., Bruguera J. IEEE Transactions on Computers 47(2): 152-161, 1998. Type: Article
The authors describe a circuit for calculating the square root of the ratio of two numbers. If the denominator is set at one, the circuit can also be used to calculate square roots. The computation time is nearly proportional to the lo...
|
Aug 1 1998 |
|
|
|
|
|
|
Probably approximately optimal satisficing strategies
Greiner R. (ed), Orponen P. Artificial Intelligence 82(1-2): 21-44, 1996. Type: Article
A decision structure is a finite structure that specifies a set of sequences of experiments and results leading to decisions. It is called “tree-like” if one can identify with each experiment s a unique seque...
|
Mar 1 1997 |
|
|
|
|
|
| |
|
|
| |
|
|
