Sciweavers

4218 search results - page 216 / 844
» Complete sets of cooperations
Sort
View
MCU
1998
117views Hardware» more  MCU 1998»
15 years 2 months ago
The Turing Closure of an Archimedean Field
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
Paolo Boldi, Sebastiano Vigna
92
Voted
CSDA
2007
100views more  CSDA 2007»
15 years 20 days ago
Convergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
Fredrik A. Dahl
129
Voted
AI
2011
Springer
14 years 7 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
ENGL
2007
89views more  ENGL 2007»
15 years 19 days ago
Similarity-based Heterogeneous Neural Networks
This research introduces a general class of functions serving as generalized neuron models to be used in artificial neural networks. They are cast in the common framework of comp...
Lluís A. Belanche Muñoz, Julio Jose ...
121
Voted
ICICS
2010
Springer
14 years 10 months ago
Threshold Public-Key Encryption with Adaptive Security and Short Ciphertexts
Threshold public-key encryption (TPKE) allows a set of users to decrypt a ciphertext if a given threshold of authorized users cooperate. Existing TPKE schemes suffer from either lo...
Bo Qin, Qianhong Wu, Lei Zhang, Josep Domingo-Ferr...