Sciweavers

Share
LOGCOM
2010
120views more  LOGCOM 2010»
8 years 3 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
IFIP
2010
Springer
8 years 3 months ago
Rialto 2.0: A Language for Heterogeneous Computations
Modern embedded systems are often heterogeneous in that their design requires several description paradigms, based on different models of computation and concurrency (MoCCs). In th...
Johan Lilius, Andreas Dahlin, Lionel Morel
CSC
2010
8 years 3 months ago
Performance Modeling, Analysis, and Optimization of Cell-List Based Molecular Dynamics
- We have developed a performance prediction model for non-bonded interaction computations in molecular dynamics simulations, thereby predicting the optimal cell dimension in a lin...
Manaschai Kunaseth, Rajiv K. Kalia, Aiichiro Nakan...
CASC
2010
Springer
153views Mathematics» more  CASC 2010»
8 years 5 months ago
Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...
Oleg Lobachev, Rita Loogen
ENTCS
2010
96views more  ENTCS 2010»
8 years 5 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
ECEASST
2010
8 years 5 months ago
Open Source Verification under a Cloud
Abstract: An experiment in providing volunteer cloud computing support for automated audits of open source code is described here, along with the supporting theory. Certification a...
Peter T. Breuer, Simon Pickin
CORR
2010
Springer
90views Education» more  CORR 2010»
8 years 5 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat
CASES
2009
ACM
8 years 6 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
USS
2010
8 years 6 months ago
SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics
Secure multiparty computation (MPC) allows joint privacy-preserving computations on data of multiple parties. Although MPC has been studied substantially, building solutions that ...
Martin Burkhart, Mario Strasser, Dilip Many, Xenof...
MICRO
2010
IEEE
149views Hardware» more  MICRO 2010»
8 years 6 months ago
ReMAP: A Reconfigurable Heterogeneous Multicore Architecture
This paper presents ReMAP, a reconfigurable architecture geared towards accelerating and parallelizing applications within a heterogeneous CMP. In ReMAP, threads share a common rec...
Matthew A. Watkins, David H. Albonesi
books