Sciweavers

1076 search results - page 62 / 216
» Operations on proofs and labels
Sort
View
TLCA
1997
Springer
13 years 11 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Michael Brandt, Fritz Henglein
ICPR
2006
IEEE
14 years 8 months ago
Type-2 Fuzzy Markov Random Fields to Handwritten Character Recognition
This paper integrates Markov random fields (MRFs) with type-2 fuzzy sets (T2 FSs) referred to as T2 FMRFs, which can handle the fuzziness of the labeling space as well as the rand...
Jia Zeng, Zhi-Qiang Liu
SLSFS
2005
Springer
14 years 1 months ago
Generalization Bounds for Subspace Selection and Hyperbolic PCA
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
Andreas Maurer
HICSS
2007
IEEE
125views Biometrics» more  HICSS 2007»
14 years 2 months ago
Stochastic Formal Methods: An Application to Accuracy of Numeric Software
— This paper provides a bound on the number of numeric operations (fixed or floating point) that can safely be performed before accuracy is lost. This work has important implic...
Marc Daumas, David Lester
TYPES
1998
Springer
13 years 12 months ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
Thomas Kleymann