The Graph Minors Project of Neil Robertson and Paul Seymour proves that if fG1; G2; : ::g is an infinite set of graphs, then there exist i and j such that Gi is a minor of Gj. In particular, if \Sigma is a surface, the set F (\Sigma) of graphs G that do not embed in \Sigma but every proper minor of which does embed in \Sigma must be finite.

the late 1970s and early 1980s. Methodologically, I approach this question in two steps. In the first step, I estimate a production function to obtain a measure of plant productivity. I estimate the production function semiparametrically to correct for the presence of selection and simultaneity biases

Method, the in-situ stress conditions should be incorporated in the analysis following the generation of the FE mesh and prior to the consideration of the actions due to the engineering design The method described in this paper involves basically two steps. In the first one a first estimate

and the structure, color and texture of object surfaces, from the two-dimensional image that is projected onto the eye or camera. This goal is not achieved in a single step; vision proceeds in stages, with each stage producing increasingly more useful descriptions of the image and then the scene. The first clue

This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task

to obtain the 3-billion-base human genome sequence by the target date of 2005. To reach this goal, improved automation will be essential, and it is particularly important that human involvement in sequence data processing be significantly reduced or eliminated. Progress in this respect will require both

Building animation tools for fluid-like motions is an important and challenging problem with many applications in computer graphics. The use of physics-based models for fluid flow can greatly assist in creating such tools. Physical models, unlike key frame or procedural based techniques, permit

Abstract. The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location

This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new

queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.