IPPS
2010
IEEE
14 years 6 days ago
2010
IEEE
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
ICDM
2010
IEEE
14 years 8 days ago
2010
IEEE
Abstract--This paper presents a framework for privacypreserving Gaussian Mixture Model computations. Specifically, we consider a scenario where a central service wants to learn the...
ICCAD
2010
IEEE
14 years 8 days ago
2010
IEEE
Abstract--We present a methodology for implementing digital signal processing (DSP) operations such as filtering with biomolecular reactions. From a DSP specification, we demonstra...
CODES
2010
IEEE
14 years 9 days ago
2010
IEEE
The Ptolemy project studies modeling, simulation, and design of concurrent, real-time, embedded systems. The focus is on assembly of concurrent components. The key underlying prin...
ACSD
2010
IEEE
14 years 10 days ago
2010
IEEE
Abstract--Clock gating and operand isolation are two techniques to reduce the power consumption in state-of-the-art hardware designs. Both approaches basically follow a two-step pr...
SSS
2010
Springer
14 years 20 days ago
2010
Springer
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
PROCEDIA
2010
14 years 21 days ago
2010
Modern physical theory and modern computational techniques are used to provide conjecture on how nature computes. I utilize time-domain simulation of physical phenomena and build ...
PPL
2010
14 years 21 days ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
KBSE
2010
IEEE
14 years 22 days ago
2010
IEEE
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...
CORR
2010
Springer
14 years 26 days ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...