Sciweavers

264 search results - page 31 / 53
» Decomposing Algebraic Varieties
Sort
View
APSEC
2001
IEEE
14 years 8 days ago
Formal Specification of Mixed Components with Korrigan
Formal specifications are now widely accepted in software development. Recently, the need for a separation of concerns with reference to static and dynamic aspects appeared. Furth...
Christine Choppy, Pascal Poizat, Jean-Claude Royer
DAGSTUHL
2003
13 years 10 months ago
Numerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
Andrew J. Sommese, Jan Verschelde, Charles W. Wamp...
CAD
2010
Springer
13 years 8 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
Hilderick A. van der Meiden, Willem F. Bronsvoort
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 8 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 8 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...