Search results

(1 - 7 of 7)
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...
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...
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...
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.