Sciweavers

1968 search results - page 60 / 394
» The Complexity of Valued Constraint Models
Sort
View
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 3 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
SIGGRAPH
1990
ACM
15 years 5 months ago
Fast animation and control of nonrigid structures
We describe a fast method for creating physically based animation of non-rigid objects. Rapid simulation of nonrigid behavior is based on global deformations. Constraints are used...
Andrew P. Witkin, William Welch
CORR
2004
Springer
176views Education» more  CORR 2004»
15 years 1 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
ICEIS
2009
IEEE
14 years 11 months ago
A Model-Based Tool for Conceptual Modeling and Domain Ontology Engineering in OntoUML
This paper presents a Model-Based graphical editor for supporting the creation of conceptual models and domain ontologies in a philosophically and cognitively well-founded modeling...
Alessander Botti Benevides, Giancarlo Guizzardi
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 5 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller