Sciweavers

3318 search results - page 151 / 664
» The Weak Instance Model
Sort
View
RP
2010
Springer
126views Control Systems» more  RP 2010»
13 years 6 months ago
Lossy Counter Machines Decidability Cheat Sheet
Abstract. Lossy counter machines (LCM’s) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that they can decrease nondeterministically ...
Philippe Schnoebelen
TCS
2011
13 years 3 months ago
Computational processes, observers and Turing incompleteness
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Klaus Sutner
ICCV
2011
IEEE
12 years 8 months ago
Delta-Dual Hierarchical Dirichlet Processes: A pragmatic abnormal behaviour detector
In the security domain a key problem is identifying rare behaviours of interest. Training examples for these behaviours may or may not exist, and if they do exist there will be fe...
Tom Haines, Queen Mary, Tao Xiang
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 10 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
PROVSEC
2009
Springer
14 years 2 months ago
Chosen-Ciphertext Secure RSA-Type Cryptosystems
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the standard model. We rely on instance-independence assu...
Benoît Chevallier-Mames, Marc Joye