Sciweavers

949 search results - page 121 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
14 years 3 months ago
Comprehensive Triangular Decomposition
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
Changbo Chen, Oleg Golubitsky, François Lem...
SAC
2010
ACM
14 years 3 months ago
Web-based graphical querying of databases through an ontology: the Wonder system
Biological scientists have made large amounts of data available on the Web, which can be accessed by canned or precomputed queries presented via web forms. To satisfy further info...
Diego Calvanese, C. Maria Keet, Werner Nutt, Maria...
MVA
2007
155views Computer Vision» more  MVA 2007»
13 years 10 months ago
Pre-processing Algorithms on Digital Mammograms
Mammography is the best method for early mass detection. In order to limit the search for abnormalities by Computer Aided Diagnosis systems to the region of the breast without und...
Hengameh Mirzaalian, Mohammad Reza Ahmadzadeh, Sae...
WOTUG
2008
13 years 10 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith
AGP
1995
IEEE
14 years 12 days ago
A Prolog Implementation of Kem
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...
Alberto Artosi, Paola Cattabriga, Guido Governator...