99 search results - page 8 / 20 » Stable normal forms for polynomial system solving |
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
DAGSTUHL
2003
13 years 8 months ago
2003
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...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
ACSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
We introduce a new method for detecting intrusions based on the temporal behavior of applications. It builds on an existing method of application intrusion detection developed at ...