Sciweavers

50 search results - page 10 / 10
» On the Computational Complexity of Coin Flipping
Sort
View
ASWSD
2004
Springer
13 years 11 months ago
Simulink Integration of Giotto/TDL
The paper first presents the integration options of what we call the Timing Description Language (TDL) with MathWorks' Simulink tools. Based on the paradigm of logical executi...
Wolfgang Pree, Gerald Stieglbauer, Josef Templ
ICCS
2001
Springer
13 years 10 months ago
Inclusion-Based Approximate Reasoning
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...
Chris Cornelis, Etienne E. Kerre
EH
1999
IEEE
351views Hardware» more  EH 1999»
13 years 9 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
SIGIR
2009
ACM
13 years 12 months ago
Learning to recommend with social trust ensemble
As an indispensable technique in the field of Information Filtering, Recommender System has been well studied and developed both in academia and in industry recently. However, mo...
Hao Ma, Irwin King, Michael R. Lyu
FC
2008
Springer
90views Cryptology» more  FC 2008»
13 years 7 months ago
Practical Anonymous Divisible E-Cash from Bounded Accumulators
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unl...
Man Ho Au, Willy Susilo, Yi Mu