579 search results - page 39 / 116 » Intersecting Classes and Prototypes |
ACTA
2010
14 years 12 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
110
Voted
SIAMDM
2008
14 years 11 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
IJFCS
2010
14 years 10 months ago
2010
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (Ï...
110
click to vote
CAD
2011
Springer
14 years 3 months ago
2011
Springer
The behavior of Catmull-Rom curves heavily depends on the choice of parameter values at the control points. We analyze a class of parameterizations ranging from uniform to chordal...
SMI
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose a new topological data structure for representing a set of polygonal curves embedded in a meshed surface. In this embedding, the vertices of the curve do not necessaril...