Sciweavers

10718 search results - page 75 / 2144
» On the Circuit Implementation Problem
Sort
View
132
Voted
UAI
2008
15 years 4 months ago
Sensitivity analysis in decision circuits
Decision circuits have been developed to perform efficient evaluation of influence diagrams [Bhattacharjya and Shachter, 2007], building on the advances in arithmetic circuits for...
Debarun Bhattacharjya, Ross D. Shachter
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 3 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
131
Voted
FPL
2005
Springer
144views Hardware» more  FPL 2005»
15 years 9 months ago
Accelerating Molecular Dynamics Simulations With Configurable Circuits
Molecular Dynamics (MD) is of central importance to computational chemistry. Here we show that MD can be implemented efficiently on a COTS FPGA board, and that speedups from ¿½...
Yongfeng Gu, Tom Van Court, Martin C. Herbordt
116
Voted
WADS
2007
Springer
130views Algorithms» more  WADS 2007»
15 years 9 months ago
Approximating the Maximum Sharing Problem
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer...
99
Voted
DATE
2002
IEEE
94views Hardware» more  DATE 2002»
15 years 8 months ago
Problems Due to Open Faults in the Interconnections of Self-Checking Data-Paths
In this work, the problem of open faults affecting the interconnections of SC circuits composed by data-path and control is analyzed. In particular, it is shown that, in case open...
Michele Favalli, Cecilia Metra