Sciweavers

2041 search results - page 41 / 409
» Modelling Generic Judgements
Sort
View
149
Voted
CSL
2008
Springer
15 years 4 months ago
Syntactic Metatheory of Higher-Order Subtyping
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
Andreas Abel, Dulma Rodriguez
93
Voted
LOGCOM
2006
105views more  LOGCOM 2006»
15 years 2 months ago
A Hybrid Intuitionistic Logic: Semantics and Decidability
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate propertie...
Rohit Chadha, Damiano Macedonio, Vladimiro Sassone
118
Voted
IVA
2010
Springer
15 years 1 months ago
An Intelligent Virtual Agent to Increase Involvement in Financial Services
In order to enhance user involvement in financial services, this paper proposes to combine the idea of adaptive personalisation with intelligent virtual agents. To this end, a comp...
Tibor Bosse, Ghazanfar F. Siddiqui, Jan Treur
108
Voted
ICWSM
2009
15 years 7 days ago
Regression-Based Summarization of Email Conversations
In this paper we present a regression-based machine learning approach to email thread summarization. The regression model is able to take advantage of multiple gold-standard annot...
Jan Ulrich, Giuseppe Carenini, Gabriel Murray, Ray...
142
Voted
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
13 years 5 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman