3172 search results - page 5 / 635 » On the Random-Self-Reducibility of Complete Sets |
STACS
2009
Springer
14 years 4 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
JSC
2010
13 years 4 months ago
2010
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
DIAGRAMS
2000
Springer
14 years 2 months ago
2000
Springer
Spider diagram systems provide a visual language that extends the popular and intuitive Venn diagrams and Euler circles. Designed to complement object-oriented modelling notations ...
JSC
2010
13 years 8 months ago
2010
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
CGI
2006
IEEE
14 years 3 months ago
2006
IEEE
A novel approach for appearance and geometry completion over point-sampled geometry is presented in this paper. Based on the result of surface clustering and the given texture samp...