Sciweavers

5387 search results - page 302 / 1078
» Generating generic functions
Sort
View
TC
1998
15 years 6 months ago
Abstraction Techniques for Validation Coverage Analysis and Test Generation
ion Techniques for Validation Coverage Analysis and Test Generation Dinos Moundanos, Jacob A. Abraham, Fellow, IEEE, and Yatin V. Hoskote —The enormous state spaces which must be...
Dinos Moundanos, Jacob A. Abraham, Yatin Vasant Ho...
SPAA
1992
ACM
15 years 10 months ago
Separator Based Parallel Divide and Conquer in Computational Geometry
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
SFP
2003
15 years 8 months ago
FSM-Hume is finite state
Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions c...
Greg Michaelson, Kevin Hammond, Jocelyn Sér...
DCG
2008
132views more  DCG 2008»
15 years 6 months ago
Ehrhart Series and Lattice Triangulations
Abstract We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials o...
Sam Payne
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
15 years 6 months ago
The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
Arvind Ayyer, Doron Zeilberger