Sciweavers

1628 search results - page 90 / 326
» Compiler Construction Using Scheme
Sort
View
FLAIRS
2001
15 years 3 months ago
A Method for Evaluating Elicitation Schemes for Probabilities
We present an objective approach for evaluating probability elicitation methods in probabilistic models. Our method draws on ideas from research on learning Bayesian networks: if ...
Haiqin Wang, Denver Dash, Marek J. Druzdzel
MICRO
1993
IEEE
93views Hardware» more  MICRO 1993»
15 years 6 months ago
Speculative execution exception recovery using write-back suppression
Compiler-controlled speculative execution has been shown to be e ective in increasing the availableinstruction level parallelismILP found in non-numeric programs. An importantpr...
Roger A. Bringmann, Scott A. Mahlke, Richard E. Ha...
MOBIHOC
2005
ACM
16 years 1 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
TCC
2010
Springer
176views Cryptology» more  TCC 2010»
15 years 11 months ago
Ideal Hierarchical Secret Sharing Schemes
The search of efficient constructions of ideal secret sharing schemes for families of nonthreshold access structures that may have useful applications has attracted a lot of atten...
Oriol Farràs, Carles Padró
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
15 years 2 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek