956 search results - page 30 / 192 » Dimensions in program synthesis |
FMSD
2006
13 years 10 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
FOCS
1992
IEEE
14 years 1 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
PRESENCE
2000
13 years 9 months ago
2000
We describe methods for displaying complex, texturemapped environments with four or more spatial dimensions that allow for real-time interaction. At any one moment in time, a thre...
IFIP
1999
Springer
14 years 2 months ago
1999
Springer
: This paper presents a synthesis algorithm for pipelined circuits. The circuit is specified as a collection of independent, looselycoupled modules connected by queues. The synthe...