Search results

(1 - 17 of 17)
Sets with no empty convex 7-gons
Sets with no empty convex 7-gons
Author(s):
Horton
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1982
Type:
Technical Report
Erdos has defined g(n) as the smallest integer such that any set of g(n) points in the plane, no three collinear, contains...
Computer Processing of Musical Scores
Computer Processing of Musical Scores
Author(s):
Gujar, Crawford
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1985
Type:
Technical Report
This paper proposes an encoding scheme for printed music. A computerized system is designed and implemented to read music as...
Adaptation of a Monte Carlo radiation transport code to supercomputers
Adaptation of a Monte Carlo radiation transport code to supercomputers
Author(s):
Tassou
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1986
Type:
Technical Report
Resolvable path designs
Resolvable path designs
Author(s):
Horton
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1983
Type:
Technical Report
A resolvable (balanced) path design, RBPD (v,k,) is the decomposition of λ copies of the complete graph on v vertices into...
User interface to a flexible character generator
User interface to a flexible character generator
Author(s):
Gujar
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1986
Type:
Technical Report
Evaluation of the discrepancy of the linear congruential pseudo-random number sequences
Evaluation of the discrepancy of the linear congruential pseudo-random number sequences
Author(s):
Bhavsar, Lambrou, Horton, Gujar
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1987
Type:
Technical Report
Niederreiter has defined the discrepancy of a pseudo-random number (PRN) sequence as a quantity which measures the deviation...
Monte Carlo neutron transport on the Alliant FX/8
Monte Carlo neutron transport on the Alliant FX/8
Author(s):
Tassou, Bhavsar, Hussein, Gallivan
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1986
Type:
Technical Report
A Center-of-Mass Monte Carlo program (COM) used in designing neutron densitometers is considered and its implementations are...
Pseudo-random number sequences for parallel computers
Pseudo-random number sequences for parallel computers
Author(s):
Lambrou
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1986
Type:
Technical Report
Pseudo-Random number sequences are used in a variety of computer applications, such as Monte Carlo algorithms, Numerical...
Time complexity of sequential and parallel Monte Carlo solution of linear equations
Time complexity of sequential and parallel Monte Carlo solution of linear equations
Author(s):
Bhavsar
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1987
Type:
Technical Report
The Monte Carlo method proposed by von Neumann and Ulam for solving linear equations is considered in this paper. It is shown...
A computer aided design tutorial system (CADETS)
A computer aided design tutorial system (CADETS)
Author(s):
Slipp, Gujar
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1986
Type:
Technical Report
Computer aided design (CAD) systems have proved to be a very valuable toll widely used in industry. These systems are often...
A lower bound on the number of one-factors in bicubic graphs
A lower bound on the number of one-factors in bicubic graphs
Author(s):
Horton
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1984
Type:
Technical Report
The number of one-factors in a bicubic graph is shown to be more than polynomial in the number of vertices. Thus the...
A polynomial-time algorithm to find the shortest cycle basis of a graph
A polynomial-time algorithm to find the shortest cycle basis of a graph
Author(s):
Horton
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1984
Type:
Technical Report
Define the length of a basis of a cycle space to be the sum of the lengths of all circuits in the basis. An algorithm is...
Analysis and synthesis of interpolating functions for 3-D objects
Analysis and synthesis of interpolating functions for 3-D objects
Author(s):
Datar, Gujar, Bhavsar
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1986
Type:
Technical Report
Interpolation technique has been used for generation of three dimensional surfaces. This paper first analyses the objects...
Interpolation techniques for 3-D object generation
Interpolation techniques for 3-D object generation
Author(s):
Gujar, Bhavsar, Datar
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1987
Type:
Technical Report
The technique of interpolation (or blending) and its generalization is considered in this paper. A unifying model for...
Orthogonal starters in finite abelian groups
Orthogonal starters in finite abelian groups
Author(s):
Horton
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1987
Type:
Technical Report
Two problems are considered. First, the conjecture that all odd abelian groups except Z[subscript 3], Z[subscript 5], Z...
Computer display of characters
Computer display of characters
Author(s):
Gujar, So
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1983
Type:
Technical Report
This paper describes a general and flexible character generator which is capable of producing virtually an unlimited number...
Design and analysis of parallel Monte Carlo algorithms
Design and analysis of parallel Monte Carlo algorithms
Author(s):
Bhavsar, Isaac
Discipline:
Computer Science
Discipline:
Computer Science
Date:
1985
Type:
Technical Report
This paper demonstrates that the potential of intrinsic parallelism in Monte Carlo methods, which has remained essentially...
Zircon - This is a contributing Drupal Theme
Design by WeebPal.