Sciweavers

1204 search results - page 112 / 241
» Termination of Polynomial Programs
Sort
View
92
Voted
DAGSTUHL
2003
15 years 2 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...
91
Voted
UAI
2004
15 years 2 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
91
Voted
FSTTCS
2004
Springer
15 years 6 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ISORC
2002
IEEE
15 years 5 months ago
Asynchronous Transfer of Control in the Real-Time Specification for Java
The Real-Time Specification for Java provides a facility for Asynchronous Transfer of Control based on exception handling and a generalization of the interrupt() method from the T...
Benjamin M. Brosgol, Scott Robbins, Ricardo J. Has...
104
Voted
CIE
2010
Springer
15 years 5 months ago
Higher-Order Containers
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
Thorsten Altenkirch, Paul Levy, Sam Staton