62 search results - page 9 / 13 » Branch Cuts in Computer Algebra |
ISSAC
1995
Springer
14 years 2 months ago
1995
Springer
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
CVPR
2000
IEEE
15 years 27 days ago
2000
IEEE
We introduce a fast, multiscale algorithm for image segmentation. Our algorithm uses modern numeric techniques to nd an approximate solution to normalized cut measures in time tha...
AGP
1995
IEEE
14 years 2 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
PODC
2003
ACM
14 years 4 months ago
2003
ACM
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
CSR
2007
Springer
14 years 5 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...