| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 37
reviews
|
|
|
 |
|
|
|
|
Automated location matching in movies
Schaffalitzky F., Zisserman A. Computer Vision and Image Understanding 92(2/3): 236-264, 2003. Type: Article
This paper addresses the difficult problem of recognizing camera shots of identical locations in a film, taking into account differences in camera location, and hence differences of scale and perspective, as well as partial occlusion a...
|
Mar 1 2004 |
|
|
|
|
|
|
 Improved shortest path algorithms for nearly acyclic graphs
Saunders S., Takaoka T. Theoretical Computer Science 293(3): 535-556, 2003. Type: Article
Studied in this interesting paper are fundamental problems that go back 45 years: in a graph G (n vertices, m edges) with positive edge weights, compute the distance to every ver...
|
Sep 4 2003 |
|
|
|
|
|
|
Self-organizing map for clustering in the graph domain
Günter S., Bunke H. Pattern Recognition Letters 23(4): 405-417, 2002. Type: Article
Given a set, X = {x1, x2, ... , xN} of N objects called patterns, an integer M, a distance function d on patterns, a learning...
|
Aug 4 2003 |
|
|
|
|
|
|
The boost graph library: user guide and reference manual
Siek J., Lee L., Lumsdaine A., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2002. 321 pp. Type: Book (9780201729146)
Siek, Lee, and Lumsdaine describe an integrated C++ package of graph utilities and algorithms known as the boost graph library (BGL). The programming techniques used in the development of BGL derive from those used to build the C++ st...
|
Aug 27 2002 |
|
|
|
|
|
|
Graph theory for programmers: algorithms for processing trees
Kasyanov V., Evstigneev V., Kluwer Academic Publishers, Norwell, MA, 2000. 432 pp. Type: Book (9780792364283)
The introduction to this book states that it combines two previous works, Algorithms on Trees (1984), and Algorithms of Processing of Trees (1990). On the title page, the book is described as a completely revised and upda...
|
Jun 17 2002 |
|
|
|
|
|
|
An algorithm for shortest paths in bipartite digraphs with concave weight matrices and its applications
He X., Chen Z. SIAM Journal on Computing 29(1): 65-80, 2000. Type: Article
The authors describe an O ( nlog n )-time algorithm that solves the following two problems: the traveling salesman problem (TSP) on n points of a convex polygon in the Euclidean ...
|
Sep 1 2000 |
|
|
|
|
|
|
Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm
Wei D., Felix P I., Naik K. IEEE Transactions on Parallel and Distributed Systems 10(12): 1290-1298, 1999. Type: Article
First, this paper shows that the Cayley graph of degree four on n 2n vertices is isomorphic to the n-dimensional wrapped butterfly network, a result published three years earlier by the ...
|
Mar 1 2000 |
|
|
|
|
|
|
On the complexity of the k-chain subgraph cover problem
Yu C., Chen G., Ma T. Theoretical Computer Science 205(1-2): 85-98, 1998. Type: Article
A chain graph is a bipartite graph of diameter at most 3. Thek-chain subgraph cover problem asks whether the edgeset of a given bipartite graph G can be represented as the union of the edge sets of...
|
Apr 1 1999 |
|
|
|
|
|
|
Sparsification--a technique for speeding up dynamic graph algorithms
Eppstein D., Galil Z., Italiano G., Nissenzweig A. Journal of the ACM 44(5): 669-696, 1997. Type: Article
As the authors observe, “graph algorithms are fundamental in computer science,” and therefore, so are the data structures that facilitate them. This paper introduces a data structure called a sparsification tree, wh...
|
Jun 1 1998 |
|
|
|
|
|
|
The average-case complexity of determining the majority
Alonso L., Reingold E., Schott R. SIAM Journal on Computing 26(1): 1-14, 1997. Type: Article
Let x = x [ 1 ... n ] denote an array of nonnegative integers. The multiplicity μ ( k ) of an integer k in x is the number of times
|
Feb 1 1998 |
|
|
|
|
|
| |
|
|
| |
|
|
