Sciweavers

21324 search results - page 576 / 4265
» Making the case for computing
Sort
View
FSS
2008
127views more  FSS 2008»
15 years 7 months ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...
ENTCS
2006
136views more  ENTCS 2006»
15 years 7 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand
JDCTA
2008
119views more  JDCTA 2008»
15 years 7 months ago
Towards a Coordination Infrastructure for Pervasive Computing Environment Based on Tuplespace and Semantic Web
Pervasive computing is an emerging computing paradigm, which is expected to be part of our everyday life in the foreseeable future. The coordination among heterogeneous devices, s...
Liang Li, Bin Li, Junwu Zhu
FUIN
2000
68views more  FUIN 2000»
15 years 7 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
ICASSP
2011
IEEE
14 years 11 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...