| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 21
reviews
|
|
|
 |
|
|
|
|
Geodesics-Based One-to-One Parameterization of 3D Triangle Meshes
Lee H., Tong Y., Desbrun M. IEEE MultiMedia 12(1): 27-33, 2005. Type: Article
A parameterization of a polyhedral surface S in three-space, whose boundary is a simple n-gon, is a plane triangulated graph isomorphic to S. A unique parameterization is obtaine...
|
Nov 15 2005 |
|
|
|
|
|
|
An empirical comparison of techniques for updating Delaunay triangulations
Guibas L., Russel D. Computational geometry (Proceedings of the Twentieth Annual Symposium on Computational Geometry, Brooklyn, New York, USA, Jun 8-11, 2004) 170-179, 2004. Type: Proceedings
Efficient techniques for computing the Voronoi diagram and Delaunay triangulation for a finite set of points in Euclidean space Ed are well known. This paper is concerned with the problem of computing the ...
|
Oct 12 2004 |
|
|
|
|
|
|
Introduction to protein informatics
Zimmermann K., Kluwer Academic Publishers, Norwell, MA, 2003. Type: Book (9781402075780)
According to the preface of this book, protein informatics encompasses the techniques used in bioinformatics and molecular modeling that are related to proteins....
|
Feb 10 2004 |
|
|
|
|
|
|
 Acyclic and k-distance coloring of the grid
Fertin G., Godard E., Raspaud A. Information Processing Letters 87(1): 51-58, 2003. Type: Article
A decomposition of the vertex set of a graph G into subsets is called a proper coloring if no two adjacent vertices belong to the same subset (for example, are assigned the same color). A proper coloring is acyclic i...
|
Sep 26 2003 |
|
|
|
|
|
|
The t-intersection problem in the truncated Boolean lattice: how to write them and why
Ahlswede R., Bey C., Engel K., Khachatrian L. European Journal of Combinatorics 23(5): 471-487, 2002. Type: Article
A family of subsets of X = {1, ... , n} is said to be t-intersecting if |A B| &g...
|
Jun 19 2003 |
|
|
|
|
|
|
C-Net: a method for generating non-deterministic and dynamic multivariate decision trees
Abbass H., Towsey M., Finn G. Knowledge and Information Systems 3(2): 184-197, 2001. Type: Article
The authors discuss the virtues and flaws of artificial neural networks (ANNs) and univariate decision trees (UDTs) as universal function approximators. They propose the algorithm C-Net for generating multivariate decision trees (MDTs...
|
Feb 12 2003 |
|
|
|
|
|
|
On-line single-server dial-a-ride problems
Feuerstein E., Stougie L. Theoretical Computer Science 268(1): 91-105, 2001. Type: Article
The dial-a-ride problem requires an algorithm for satisfying a set P of requests for “rides” in a minimum time. A request r specifies a source sr ...
|
Jul 19 2002 |
|
|
|
|
|
|
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Leighton T., Rao S. Journal of the ACM 46(6): 787-832, 1999. Type: Article
The authors study the relationship between the max-flow and the min-cut for multicommodity flow problems. The min-cut is an upper bound for the max-flow, and the fundamental theorem of Ford and Fulkerson shows that for a 1-commodity pr...
|
Jul 1 2000 |
|
|
|
|
|
|
The computational complexity of knot and link problems
Hass J., Lagarias J., Pippenger N. Journal of the ACM 46(2): 185-211, 1999. Type: Article
For the purposes of this paper, a “knot” is a simple polygon in 3-space. A finite collection of disjoint knots is a “link.” Two knots are “isotopic” if there is a (piecewise-l...
|
Nov 1 1999 |
|
|
|
|
|
|
Codes and algebraic curves
Pretzel O., Oxford University Press, Inc., New York, NY, 1998. Type: Book (9780198500391)
In 1992, the author published a textbook, Error-correcting codes and finite fields [1], which was primarily intended to introduce senior undergraduate students to coding theory. That book covered the basics of linear codes and f...
|
May 1 1999 |
|
|
|
|
|
| |
|
|
| |
|
|
