Courant Institute of Mathematical Sciences Computer Science Department
Overview
Works:  412 works in 448 publications in 1 language and 889 library holdings 

Genres:  Conference papers and proceedings History Technical reports 
Publication Timeline
.
Most widely held works by
Courant Institute of Mathematical Sciences
Design and optimization of compilers by Courant Computer Science Symposium(
Book
)
2 editions published in 1972 in English and held by 18 WorldCat member libraries worldwide
2 editions published in 1972 in English and held by 18 WorldCat member libraries worldwide
Higher level programming : introduction to the use of the settheoretic programming language SETL by R. B. K Dewar(
Book
)
1 edition published in 1981 in English and held by 14 WorldCat member libraries worldwide
1 edition published in 1981 in English and held by 14 WorldCat member libraries worldwide
Technical report by
State University of New York at Buffalo(
)
in English and held by 8 WorldCat member libraries worldwide
in English and held by 8 WorldCat member libraries worldwide
"0 (logn) parallel time intersection and union algorithms for a set of planar discs" by
T. S Papatheodorou(
)
2 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
Separating two simple polygons by a sequence of translations by
R Pollack(
Book
)
1 edition published in 1986 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Let P and Q be two disjoint simple polygons having m and n sides respectively. We present an algorithm which determines whether Q can be moved by a sequence of translations to a position sufficiently far from P without colliding with P, and which produces such a motion if it exists. Our algorithm runs in time O(mn [alpha](mn) log m log n) where [alpha](k) is the extremely slowly growing inverse Ackermann's function. Since in the worst case [omega](mn) translations may be necessary to separate Q from P, our algorithm is close to optimal."
1 edition published in 1986 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Let P and Q be two disjoint simple polygons having m and n sides respectively. We present an algorithm which determines whether Q can be moved by a sequence of translations to a position sufficiently far from P without colliding with P, and which produces such a motion if it exists. Our algorithm runs in time O(mn [alpha](mn) log m log n) where [alpha](k) is the extremely slowly growing inverse Ackermann's function. Since in the worst case [omega](mn) translations may be necessary to separate Q from P, our algorithm is close to optimal."
Data base systems by
Randall Rustin(
Book
)
2 editions published in 1972 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1972 in English and held by 5 WorldCat member libraries worldwide
Object recognition by 3dimensional curve matching by
C. Marc Bastuscheck(
Book
)
1 edition published in 1986 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Experimental results for the recognition of general curves in three space using registered range and intensity images are presented. The matching algorithm uses fast Fourier transforms to determine the least squares difference between sequences of points sampled at equal intervals along two piecewise linear approximations of curves in threespace and returns the rotation and translation required to bring one of the curves into closest juxtaposition with the other. Performance of the algorithm is demonstrated by matching curves in three space which are the boundaries of regions of contrasting reflectivity on curved surfaces. The experiments use a recently developed range sensor which is able to generate a 512x460x12 bit range image (with registered intensity image) in 40 seconds."
1 edition published in 1986 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Experimental results for the recognition of general curves in three space using registered range and intensity images are presented. The matching algorithm uses fast Fourier transforms to determine the least squares difference between sequences of points sampled at equal intervals along two piecewise linear approximations of curves in threespace and returns the rotation and translation required to bring one of the curves into closest juxtaposition with the other. Performance of the algorithm is demonstrated by matching curves in three space which are the boundaries of regions of contrasting reflectivity on curved surfaces. The experiments use a recently developed range sensor which is able to generate a 512x460x12 bit range image (with registered intensity image) in 40 seconds."
On condition numbers and the distance to the nearest illposed problem by
James W Demmel(
Book
)
3 editions published between 1985 and 1987 in English and held by 5 WorldCat member libraries worldwide
3 editions published between 1985 and 1987 in English and held by 5 WorldCat member libraries worldwide
Learning as the evolution of representation by Pasquale Caianiello(
Book
)
1 edition published in 1989 in English and held by 5 WorldCat member libraries worldwide
Abstract: "A widely accepted approach to the formal modelling of learning is to view it as a process of constructing highlevel structures that allow compression of raw data. The main results of this thesis are a number of precise formulation of this process, and a few algorithms that carry it out. Our rigorous definitions allow us to identify of a novel concept of structure: the alphabet. We propose that a learning mechanism is one which constructs such structures as representations of the given data. The alphabet allows to draw interesting links between theories in pattern recognition and pattern classification
1 edition published in 1989 in English and held by 5 WorldCat member libraries worldwide
Abstract: "A widely accepted approach to the formal modelling of learning is to view it as a process of constructing highlevel structures that allow compression of raw data. The main results of this thesis are a number of precise formulation of this process, and a few algorithms that carry it out. Our rigorous definitions allow us to identify of a novel concept of structure: the alphabet. We propose that a learning mechanism is one which constructs such structures as representations of the given data. The alphabet allows to draw interesting links between theories in pattern recognition and pattern classification
Efficient motion planning for an Lshaped object by
D Halperin(
Book
)
2 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We present an algorithm that solves the following motionplanning problem. Given an Lshaped body L and a 2dimensional region with n point obstacles, decide whether there is a continuous motion connecting two given positions and orientations of L during which L avoids collision with the obstacles. The algorithm requires O(n²log²n) time and O(n²) storage. The algorithm is a variant of the celldecomposition technique of the configuration space ([SS, LS]) but it employs a new and efficient technique for obtaining a compact representation of the free space, which results in a saving of an order of magnitude. The approach used in our algorithm seems applicable to motionplanning of certain robotic arms whose spaces of free placements have a structure similar to that of the Lshaped body."
2 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We present an algorithm that solves the following motionplanning problem. Given an Lshaped body L and a 2dimensional region with n point obstacles, decide whether there is a continuous motion connecting two given positions and orientations of L during which L avoids collision with the obstacles. The algorithm requires O(n²log²n) time and O(n²) storage. The algorithm is a variant of the celldecomposition technique of the configuration space ([SS, LS]) but it employs a new and efficient technique for obtaining a compact representation of the free space, which results in a saving of an order of magnitude. The approach used in our algorithm seems applicable to motionplanning of certain robotic arms whose spaces of free placements have a structure similar to that of the Lshaped body."
Comparing three approaches to transformational programming by
Konstantin Laufer(
Book
)
1 edition published in 1991 in English and held by 5 WorldCat member libraries worldwide
By contrast, 'Algorithmics, ' the work on algebraic specification originating from IFIP WG 2.1, is a pure pencilandpaper approach to transformational programming. It provides a concise, uniform mathematical notation and includes work on nondeterminism. RAPTS (Robert A. Paige's Transformation System) is a fully mechanical system that transforms high level specifications to C code. The specifications are given in a functional subset of SETL augmented with fixedpoint operations. First, we describe each system in detail and highlight interesting features. Next, we establish a framework of common criteria by which such different transformational systems can be evaluated. Finally, we point out common features and differences of the three systems and compare them."
1 edition published in 1991 in English and held by 5 WorldCat member libraries worldwide
By contrast, 'Algorithmics, ' the work on algebraic specification originating from IFIP WG 2.1, is a pure pencilandpaper approach to transformational programming. It provides a concise, uniform mathematical notation and includes work on nondeterminism. RAPTS (Robert A. Paige's Transformation System) is a fully mechanical system that transforms high level specifications to C code. The specifications are given in a functional subset of SETL augmented with fixedpoint operations. First, we describe each system in detail and highlight interesting features. Next, we establish a framework of common criteria by which such different transformational systems can be evaluated. Finally, we point out common features and differences of the three systems and compare them."
Fuzzy disk modeling and rendering of textured complex 3D surfaces of real objects by
XueDong Yang(
Book
)
1 edition published in 1988 in English and held by 5 WorldCat member libraries worldwide
This threedimensional fuzzy disk representation is organized into a multiresolution structure which allows adaptive refinement of surfaces details and supports a coarsetofine display process. A scanline rendering algorithm has been developed to synthesize images from the new model. We also present a simpler, less accurate, but more efficient approximation to the original model. In addition, we present a fast shadow penumbra approximation algorithm capable of generating soft shadows."
1 edition published in 1988 in English and held by 5 WorldCat member libraries worldwide
This threedimensional fuzzy disk representation is organized into a multiresolution structure which allows adaptive refinement of surfaces details and supports a coarsetofine display process. A scanline rendering algorithm has been developed to synthesize images from the new model. We also present a simpler, less accurate, but more efficient approximation to the original model. In addition, we present a fast shadow penumbra approximation algorithm capable of generating soft shadows."
The evolution of parallel logic programming languages by
Nikolaos Markantonatos(
Book
)
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
Online motion planning : case of a planar rod by J Cox(
Book
)
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
We are able to obtain an algorithm with path complexity (O(k)=O(n²) guarded moves, where n is the number of obstacle walls, and k the number of pairs of obstacle walls and corners of distance less than or equal to the length of the ladder) that matches the known lower bound[Ork85]. This lower bound holds for both the online and offline (where the environment is explicitly given) versions of the problem. The computational complexity of the algorithm O(k log n) matches the best known algorithm [Sfs] for the offline version."
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
We are able to obtain an algorithm with path complexity (O(k)=O(n²) guarded moves, where n is the number of obstacle walls, and k the number of pairs of obstacle walls and corners of distance less than or equal to the length of the ladder) that matches the known lower bound[Ork85]. This lower bound holds for both the online and offline (where the environment is explicitly given) versions of the problem. The computational complexity of the algorithm O(k log n) matches the best known algorithm [Sfs] for the offline version."
Coordinated motion planning for two independent robots by
Micha Sharir(
Book
)
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1988 in English and held by 4 WorldCat member libraries worldwide
On the number of critical free contacts of a convex polygonal object moving in 2D polygonal space by D Leven(
Book
)
1 edition published in 1985 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 4 WorldCat member libraries worldwide
Cepstral filtering on a columnar image architecture : a fast algorithm for binocular stereo segmentation by
Yehezkel Yeshurun(
Book
)
1 edition published in 1987 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 4 WorldCat member libraries worldwide
A double exponential lower bound for degreecompatible Gröbner bases by
CheeKeng Yap(
Book
)
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
We describe an ideal Jn, d [n, d is subscript] generated by O(n) polynomials of degree d + O(1) over 4n variables such that every Gröbner basis for Jn, d [subscript n, d] with respect to degreecompatible orderings has maximum degree [greaterthan or equalto] d2n1 [superscript 2n1]
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
We describe an ideal Jn, d [n, d is subscript] generated by O(n) polynomials of degree d + O(1) over 4n variables such that every Gröbner basis for Jn, d [subscript n, d] with respect to degreecompatible orderings has maximum degree [greaterthan or equalto] d2n1 [superscript 2n1]
Automated inversion of a unification parser into a unification generator by
Tomek Strzalkowski(
Book
)
1 edition published in 1989 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 4 WorldCat member libraries worldwide
Parallel construction of a suffix tree by
Gad M Landau(
Book
)
1 edition published in 1986 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1986 in English and held by 4 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Sharir, Micha Author
 Courant Institute of Mathematical Sciences Computer Science Division Robotics Research
 Schwartz, Jacob T. Author
 Cole, Richard Author
 Vishkin, Uzi Author
 Rustin, Randall
 Agarwal, Pankaj K. Author
 Widlund, Olof B. Author
 Shasha, Dennis Author
 Spirakis, P. G. (Paul G.) 1955 Author
Associated Subjects
Algorithms Compilers (Computer programs) Compiling (Electronic computers) Computational complexity Computer graphics Computer programming Computers Computer science ComputersMathematics Computer vision Eigenvalues Eigenvectors Electronic data processing Geometry, PlaneData processing Geometry, Solid Image analysis Image processing Imaging systems in medicine Learning, Psychology of Machine theory Matrices NavigationPlanning Parallel algorithms Parallel logic programming Parallel programming (Computer science) Pattern perception Polygons Polynomials RobotsMotion RobotsMotionPlanning SETL (Computer program language) Software engineering Trees (Graph theory)
Alternative Names
Courant Institute of Mathematical Sciences
Courant Institute of Mathematical Sciences Computer Science Department
Courant Institute of Mathematical Sciences. Computer Science Dept.
Courant Institute of Mathematical Sciences. Department of Computer Science
Languages