Sciweavers

579 search results - page 39 / 116
» Intersecting Classes and Prototypes
Sort
View
ACTA
2010
191views more  ACTA 2010»
13 years 8 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 7 months ago
On the Graph Bisection Cut Polytope
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 ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
IJFCS
2010
60views more  IJFCS 2010»
13 years 6 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (Ï...
Andreas Maletti, Catalin Ionut Tîrnauca
CAD
2011
Springer
12 years 11 months ago
Parameterization and applications of Catmull-Rom curves
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...
Cem Yuksel, Scott Schaefer, John Keyser
SMI
2005
IEEE
14 years 1 months ago
Mesh Editing with an Embedded Network of Curves
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...
Wan-Chiu Li, Bruno Lévy, Jean-Claude Paul