Sciweavers

344 search results - page 40 / 69
» Some Theorems We Should Prove
Sort
View
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 9 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
IICAI
2007
13 years 8 months ago
Topologically Continuous Associative Memory: A Theoretical Foundation
We introduce a neural network with associative memory and a continuous topology, i.e. its processing units are elements of a continuous metric space and the state space is Euclide...
Enrique Carlos Segura
JMLR
2006
186views more  JMLR 2006»
13 years 7 months ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
CADE
2005
Springer
14 years 7 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
ICML
2004
IEEE
14 years 8 months ago
Learning with non-positive kernels
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
Alexander J. Smola, Cheng Soon Ong, Stéphan...