Sciweavers

68 search results - page 2 / 14
» Deriving class instances for datatypes
Sort
View
ICAIL
2007
ACM
13 years 8 months ago
The Legal-RDF Ontology. A Generic Model for Legal Documents
Legal-RDF.org1 publishes a practical ontology that models both the layout and content of a document and metadata about the document; these have been built using data models implici...
John McClure
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
13 years 8 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
JFP
2010
82views more  JFP 2010»
13 years 3 months ago
Formal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Wendy Verbruggen, Edsko de Vries, Arthur Hughes
ACCV
2010
Springer
12 years 11 months ago
One-Class Classification with Gaussian Processes
Detecting instances of unknown categories is an important task for a multitude of problems such as object recognition, event detection, and defect localization. This paper investig...
Michael Kemmler, Erik Rodner, Joachim Denzler
ENTCS
2006
130views more  ENTCS 2006»
13 years 4 months ago
LSC Verification for UML Models with Unbounded Creation and Destruction
The approaches to automatic formal verification of UML models known up to now require a finite bound on the number of objects existing at each point in time. In [4] we have observ...
Bernd Westphal