Sciweavers

4324 search results - page 38 / 865
» A Generalized Representer Theorem
Sort
View
85
Voted
ENTCS
2007
104views more  ENTCS 2007»
15 years 19 days ago
General Reversibility
The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we t the core of...
Vincent Danos, Jean Krivine, Pawel Sobocinski
112
Voted
CADE
2009
Springer
16 years 1 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
76
Voted
FS
2006
82views more  FS 2006»
15 years 21 days ago
A super-replication theorem in Kabanov's model of transaction costs
We prove a general version of the super-replication theorem, which applies to Kabanov's model of foreign exchange markets under proportional transaction costs. The market is ...
Luciano Campi, Walter Schachermayer
120
Voted
EUROPAR
2006
Springer
15 years 4 months ago
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
108
Voted
PSSS
2003
15 years 2 months ago
Extending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
Tanel Tammet