956 search results - page 30 / 192 » Dimensions in program synthesis |
114
Voted
FMSD
2006
15 years 2 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...
112
Voted
ICALP
2005
Springer
15 years 8 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...
122
Voted
FOCS
1992
IEEE
15 years 6 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...
110
Voted
PRESENCE
2000
15 years 2 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...
88
Voted
IFIP
1999
Springer
15 years 6 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...