Result page:
1
2
3
4
5
6
7
8
9
10
>>
1
May 2008
ACM Transactions on Design Automation of Electronic Systems (TODAES): Volume 12 Issue 3, August 2007
Publisher: ACM
Bibliometrics:
Citation Count: 19
Downloads (6 Weeks): 2, Downloads (12 Months): 29, Downloads (Overall): 786
Full text available:
PDF
Parameter variations, noise susceptibility, and increasing energy dissipation of cmos devices have been recognized as major challenges in circuit and microarchitecture design in the nanometer regime. Among these, parameter variations and noise susceptibility are increasingly causing cmos devices to behave in an “unreliable” or “probabilistic” manner. To address these challenges, ...
Keywords:
probabilistic computing, Embedded systems
Keywords:
probabilistic computing
References:
Nepal, K., Bahar, R. I., Mundy, J., Patterson, W. R., and Zaslavsky, A. 2005. Designing logic circuits for probabilistic computation in the presence of noise. In Proceedings of the 42nd Design Automation Conference. 485--490.
Palem, K. V. 2003a. Energy aware algorithm design via probabilistic computing: From algorithms and models to Moore's law and novel (semiconductor) devices. In Proceedings of the International Conference on Compilers, Architecture and Synthesis for Embedded Systems (San Jose, CA), 113--117.
Full Text:
... al. 2005]. These insights and resultsform the basis of energy-efficient probabilistic computing using PCMOS devices.Utilizing defective logic elements for reliable computing is ...
... PATTERSON, W. R., AND ZASLAVSKY, A. 2005. Designing logiccircuits for probabilistic computation in the presence of noise. In Proceedings of the 42nd ... Conference. 485?490.PALEM, K. V. 2003a. Energy aware algorithm design via probabilistic computing: : From algorithmsand models to Moore?s law and novel (semiconductor) ...
2
January 2012
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 9 Issue 1, January 2012
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2, Downloads (12 Months): 6, Downloads (Overall): 116
Full text available:
PDF
Forensic samples containing DNA from two or more individuals can be difficult to interpret. Even ascertaining the number of contributors to the sample can be challenging. These uncertainties can dramatically reduce the statistical weight attached to evidentiary samples. A probabilistic mixture algorithm that takes into account not just the number ...
Keywords:
DNA, mixture, probabilistic computation, optimization, bioinformatics.
Keywords:
DNA, mixture, probabilistic computation, optimization, bioinformatics.
Full Text:
... the number of contributors to such a mixture.Index Terms?DNA, mixture, probabilistic computation, , optimization, bioinformatics. 1 INTRODUCTIONFORENSIC science has seen the discovery and ...
3
May 2013
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing: Volume 12 Issue 2s, May 2013
Publisher: ACM
Bibliometrics:
Citation Count: 18
Downloads (6 Weeks): 48, Downloads (12 Months): 531, Downloads (Overall): 1,299
Full text available:
PDF
Stochastic computing (SC) was proposed in the 1960s as a low-cost alternative to conventional binary computing. It is unique in that it represents and processes information in the form of digitized probabilities. SC employs very low-complexity arithmetic units which was a primary design concern in the past. Despite this advantage ...
Keywords:
Probabilistic computation, stochastic computing, stochastic logic
Keywords:
Probabilistic computation
References:
Mansinghka, V. 2009. Natively probabilistic computation. Ph.D. dissertation, Massachusetts Institute of Technology, Department of Brain and Cognitive Sciences, Cambridge, MA.
Nepal, K., Bahar, R. I., Mundy, J., Patterson, W. R., and Zaslavsky, A. 2005. Designing logic circuits for probabilistic computation in the presence of noise. In Proceedings of the Design Automation Conference. 485--490.
Full Text:
... [Computer SystemsOrganization]: Processor ArchitecturesGeneral Terms: ReliabilityAdditional Key Words and Phrases: Probabilistic computation, , stochastic computing, stochastic logicACM Reference Format:Alaghi, A. and Hayes, ...
... of reducing the effect ofany resulting errors. Other examples of probabilistic computing hardware are found inACM Transactions on Embedded Computing Systems, Vol. ...
... Encyclopedia of Complexity and System Science, Springer.271?294.Mansinghka, V. 2009. Natively probabilistic computation. . Ph.D. dissertation, Massachusetts Institute ofTechnology, Department of Brain and ...
4
June 2012
LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1, Downloads (12 Months): 7, Downloads (Overall): 58
Full text available:
PDF
A finite state Markov chain M is often viewed as a probabilistic transition system. An alternative view - which we follow here - is to regard M as a linear transform operating on the space of probability distributions over its set of nodes. The novel idea here is to discretize ...
Keywords:
Model Checking, Probabilistic Computation, Approximation, Markov Processes
Keywords:
Model Checking, Probabilistic Computation, Approximation, Markov Processes
Full Text:
... of independent interest and can lead to otherapplications.Index Terms?Model Checking, Probabilistic Computation, ,Approximation, Markov Processes.I. INTRODUCTIONFinite state Markov chains are a fundamental ...
5
October 2009
CASES '09: Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 8, Downloads (12 Months): 46, Downloads (Overall): 243
Full text available:
PDF
Probabilistic CMOS is considered to be a promising technology for substantial energy savings for computing devices, such as DSPs and graphics chips. The basic principle is to relax the energy requirement by allowing possibly incorrect computation results. For devices with probabilistic components, energy should be assigned to each component wisely, ...
Keywords:
multiplier, optimization, probabilistic computation, voltage scaling
Keywords:
probabilistic computation
6
June 2012
DAC '12: Proceedings of the 49th Annual Design Automation Conference
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 2, Downloads (12 Months): 11, Downloads (Overall): 239
Full text available:
PDF
We present an overview of state-of-the-art work in the engineering of digital systems (hardware and software) where traditional correctness requirements are relaxed, usually for higher performance and lower resource consumption but possibly also for other non-functional properties such as more robustness and less cost. The work presented here is categorized ...
Keywords:
performance, probabilistic computing, relaxed correctness, robustness, power consumption, scalability
Keywords:
probabilistic computing
Full Text:
... DescriptorsC.0 [Computer Systems Organization]: GeneralGeneral TermsAlgorithms, Design, Performance, ReliabilityKeywordsrelaxed correctness, probabilistic computing, , performance,scalability, power consumption, robustness?This work has been supported by ...
7
July 2016
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3, Downloads (12 Months): 16, Downloads (Overall): 16
Full text available:
PDF
We show that the Kolmogorov extension theorem and the Doob martingale convergence theorem are two aspects of a common generalization, namely a colimit-like construction in a category of Radon spaces and reversible Markov kernels. The construction provides a compositional denotational semantics for lossless iteration in probabilistic programming languages, even in ...
Keywords:
probabilistic computation, Kolmogorov extension, Markov processes, compositionality, martingale convergence
Keywords:
probabilistic computation
Full Text:
... [Probability and Statis-tics]: Markov processes, Stochastic processes; F.1.2 [Modes ofComputation]: Probabilistic computation; ; F.3.2 [Semantics ofProgramming Languages]: Algebraic approaches to semantics, De-notational ...
8
October 2006
CASES '06: Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
Publisher: ACM
Bibliometrics:
Citation Count: 29
Downloads (6 Weeks): 4, Downloads (12 Months): 40, Downloads (Overall): 667
Full text available:
Pdf
Probabilistic arithmetic, where the i th output bit of addition and multiplication is correct with a probability p i , is shown to be a vehicle for realizing extremely energy-efficient, embedded computing. Specifically, probabilistic adders and multipliers, realized using elements such as gates that are in turn probabilistic, are shown ...
Keywords:
low power, probabilistic arithmetic, probabilistic computing, DSP, PCMOS
Keywords:
probabilistic computing
References:
K. Nepal, R. Bahar, J. Mundy, W. Patterson, and A. Zaslavsky, "Designing logic circuits for probabilistic computation in the presence of noise," in Proc. of Design Automation Conference June 2005, pp. 486--490.
Full Text:
... was instead treated as a ?resource? to enable ultra-low energy, probabilistic computing architectures. In thispaper, we extend these insights and principles of ...
... pattern recog-nition, spoken alphabet recognition, and computer security.This principal of probabilistic computing can be further ex-panded into error-tolerant applications in the form ...
... meant to serve as aguide to aid in designing a probabilistic computing element,and is derived from the needs of the application where ...
9
May 2005
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 2, Downloads (12 Months): 12, Downloads (Overall): 374
Full text available:
PDF
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit distance for strings. The query complexity of the tester is polylogarithmic in the size of the set. Previous testers ...
Keywords:
edit distance, group multiplication testing, probabilistic computation, quantum computation
Keywords:
probabilistic computation
10
March 1994
Journal of the ACM (JACM): Volume 41 Issue 2, March 1994
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1, Downloads (12 Months): 10, Downloads (Overall): 393
Full text available:
PDF
For any fixed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time. The algorithm always finds the ...
Keywords:
computational geometry, linear programming, parallel computation, probabilistic computation, multidimensional search
Keywords:
probabilistic computation
11
June 2005
DAC '05: Proceedings of the 42nd annual Design Automation Conference
Publisher: ACM
Bibliometrics:
Citation Count: 20
Downloads (6 Weeks): 3, Downloads (12 Months): 21, Downloads (Overall): 380
Full text available:
PDF
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront devices and interconnections with a large number of inherent defects, which motivates the search for new architectural paradigms. In this paper, we examine probabilistic-based design methodologies ...
Keywords:
reliability, emerging technologies, nanodevices, noise immunity, Markov random fields, probabilistic computing, subthreshold operation
Title:
Designing logic circuits for probabilistic computation in the presence of noise
Keywords:
probabilistic computing
Abstract:
... extends to all levels of a design, where formally optimum probabilistic computation can be implemented as a natural element of the processing ...
Full Text:
untitledDesigning Logic Circuits for Probabilistic Computation inthe Presence of NoiseK. Nepal, R. I. Bahar, J. Mundy, ... extends to all levels of a design, where for-mally optimum probabilistic computation can be implemented as anatural element of the processing structure.Categories ...
... while [9] did discuss the theoretical util-ity of MRF for probabilistic computation in the presence ofnoise and soft faults, no practical implementation ... the paper is organized as follows. The enabling the-ory of probabilistic computation based on the Markov random field(MRF) approach, is described in ...
... (MRF) [7][8]. Previous workhas discussed the use of MRF for probabilistic computation in thepresence of noise and faults [9]; however, no practical ... real devices was suggested. Now, we propose to im-plement MRF-based probabilistic computation in ultimate CMOStransistors.An appropriate model for theMRF is a graph ... and kT corresponds to the thermal energy. For thepurposes of probabilistic computation based on interacting nano-devices, we need to find a physical ... via the exchange interaction. However, we chooseto map the MRF probabilistic computation onto nanoscale CMOS,which is by far the most mature and ...
... designing the circuits usingtheMarkov Random Field as a framework for probabilistic comput- -ing, the design becomes noise-immune, thereby freeing the designprocess from ...
12
January 2017
POPL 2017: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6, Downloads (12 Months): 80, Downloads (Overall): 80
Full text available:
PDF
We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its adequacy for a fully fledged quantum programming language in which entanglement, duplication, and recursion are all available. This model is an instance of a new framework which captures not only quantum but also classical and probabilistic ...
Keywords:
Geometry of Interaction, lambda calculus, memory structure, probabilistic computation, quantum computation
Also published in:
May 2017
ACM SIGPLAN Notices - POPL '17: Volume 52 Issue 1, January 2017
Keywords:
probabilistic computation
Abstract:
Full Text:
... new framework which captures notonly quantum but also classical and probabilistic computation. . Itsmain feature is the ability to model commutative effects ...
13
Jian-Ping Wang,
Sachin S. Sapatnekar,
Chris H. Kim,
Paul Crowell,
Steve Koester,
Supriyo Datta,
Kaushik Roy,
Anand Raghunathan,
X. Sharon Hu,
Michael Niemier,
Azad Naeemi,
Chia-Ling Chien,
Caroline Ross,
Roland Kawakami
June 2017
DAC '17: Proceedings of the 54th Annual Design Automation Conference 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 115, Downloads (12 Months): 115, Downloads (Overall): 115
Full text available:
PDF
Many key technologies of our society, including so-called artificial intelligence (AI) and big data, have been enabled by the invention of transistor and its ever-decreasing size and ever-increasing integration at a large scale. However, conventional technologies are confronted with a clear scaling limit. Many recently proposed advanced transistor concepts are ...
Keywords:
Spintronics, nonvolatile computing, post-CMOS, probabilistic computing, spin memory, stochastic computing, beyond-CMOS, logic-in-memory, neuromorphic computing, spin logic
Keywords:
probabilistic computing
Abstract:
... such as the spin memory, logic-in-memory, cognitive computing, stochastic and probabilistic computing
Full Text:
... such as the spin memory, logic-in-memory, cognitive computing, stochastic and probabilistic computing and reconfigurable information processing. KEYWORDS: Spintronics, spin logic, spin memory, ... logic, spin memory, beyond-CMOS, post-CMOS, neuromorphic computing, stochastic computing, logic-in-memory, probabilistic computing, , nonvolatile computing. 1 INTRODUCTION The inherent properties of ferromagnetic ...
... implementations were ~9X more energy efficient than CMOS. 2.6 Spin-based Probabilistic Computing Conventional logic and memory devices use stable deterministic units such ...
... acting in the inverse mode performs integer factorization, suggesting that probabilistic computers based on robust room temperature p-bits could provide practically useful ...
14
March 1997
EDTC '97: Proceedings of the 1997 European conference on Design and Test
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1, Downloads (12 Months): 2, Downloads (Overall): 156
Full text available:
PDF
Recent results have shown that clock-gating techniques are effective in reducing the total power consumption of sequential circuits. Unfortunately, such techniques assume the availability of the state transition graph of the target system, and rely on explicit algorithms whose complexity is polynomial in the number of states, that is, exponential ...
Keywords:
BDD, Boolean function, controller, clock-gating logic, pseudo-Boolean function, probabilistic computation, symbolic synthesis, control-oriented synchronous network, power optimization, sequential circuits
Keywords:
probabilistic computation
Abstract:
... be generated and/or manipulated. Moreover, symbolic manipulation techniques allow accurate probabilistic computations; ; in particular, they enable the use of non-equiprobable primary ...
Full Text:
... generated and/or manipulated. Moreover, symbolic manipulation techniques al- low accurate probabilistic computations; ; in particular, they en- able the use of non-equiprobable ...
15
September 2012
NSPW '12: Proceedings of the 2012 New Security Paradigms Workshop
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 4, Downloads (12 Months): 16, Downloads (Overall): 197
Full text available:
PDF
In this paper, we present a set of security requirements for critical systems, fundamental premises that those requirements would entail, and ideas for implementations that would instantiate those premises. We discuss the overriding requirement guiding our paradigm: that "first principles" reflects the only real security strategy, where first principles are ...
Keywords:
identity binding, metrics, continuous authentication, dynamic access control, probabilistic computing, trust negotiation, assurance, fault tolerance, first principles, formal methods, insiders, perfect privacy, security policy
Keywords:
probabilistic computing
16
January 1998
Journal of the ACM (JACM): Volume 45 Issue 1, Jan. 1998
Publisher: ACM
Bibliometrics:
Citation Count: 277
Downloads (6 Weeks): 12, Downloads (12 Months): 111, Downloads (Overall): 1,830
Full text available:
PDF
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L ) can be verified probabilistically in polynomial time using logarithmic number of random bits and by reading sublogarithmic number of bits from ...
Keywords:
hardness of approximations, NP-completeness, computations on polynomials and finite fields, proof checking, approximation algorithms, error-correcting codes, interactive computation, probabilistic computation, complexity hierarchies, reducibility and completeness, trade-offs/relations among complexity measures
Keywords:
probabilistic computation
Full Text:
... and finite fields, error-correcting codes, hardness of approximations, interactivecomputation, NP-completeness, probabilistic computation, , proof checking, reducibility and complete-ness, trade-offs/relations among complexity measuresA ...
17
July 2007
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 0, Downloads (12 Months): 9, Downloads (Overall): 208
Full text available:
PDF
A general framework of quantum-inspired multi-objective evolutionary algorithms as well as one of its sufficient convergence conditions to Pareto optimal set is proposed.
Keywords:
Pareto optimal set, multi-objective evolutionary algorithms, quantum computing, stochastic convergence
CCS:
Probabilistic computation
Primary CCS:
Probabilistic computation
Full Text:
... Subject Descriptors F.1.2 [Theory of Computation] Modes of Computation ? Probabilistic computations. . General Terms Algorithms, Theory. Keywords Quantum computing, multi-objective evolutionary ...
18
December 2007
ACM SIGCSE Bulletin: Volume 39 Issue 4, December 2007
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4, Downloads (12 Months): 12, Downloads (Overall): 81
Full text available:
PDF
Bayesian theorem is the theoretical basis of uncertainty management as well as the stochastic foundation for forecast-oriented expert systems. Mathematically, the reasoning steps can be represented by a sequence of probabilistic computations. To reduce the mathematical complexity and make it mentally manageable, an assumption, known as Bayesian Assumption, is usually ...
Keywords:
uncertainty management, Bayesian assumption, Bayesian reasoning
CCS:
Probabilistic computation
Abstract:
... the reasoning steps can be represented by a sequence of probabilistic computations. . To reduce the mathematical complexity and make it mentally ...
Primary CCS:
Probabilistic computation
Full Text:
... the reasoning steps can be represented by a sequence of probabilistic computations. . To reduce the mathematical complexity and make it mentally ... F.1.2 [Theory of Computation]: Computation by Abstract Devices, Modes of Computation---Probabilistic computation General Terms: Theory Keywords: Bayesian reasoning, Bayesian assumption, uncertainty management ...
... to estimate mentally but can be illustrated by showing the probabilistic computation of cases from best-fitted, partial-fitted to worst-fitted. 3.1 The Best-Fitted ...
19
June 2007
STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 16
Downloads (6 Weeks): 5, Downloads (12 Months): 12, Downloads (Overall): 261
Full text available:
PDF
We develop a general approach for improving the efficiency of a computationally bounded receiver interacting with a powerful and possibly malicious sender. The key idea we use is that of delegating some of the receiver's computation to the (potentially malicious) sender. This idea was recently introduced by Goldwasser et al. ...
Keywords:
constant-depth circuits, interactive proofs, error-correcting codes
CCS:
Probabilistic computation
Primary CCS:
Probabilistic computation
20
June 2011
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 2, Downloads (12 Months): 12, Downloads (Overall): 327
Full text available:
PDF
We prove that the pseudorandom generator introduced by Impagliazzo et al. (1994) with proper choice of parameters fools group products of a given finite group G. The seed length is O((|G| O(1) + log 1/δ)log n), where n is the length of the word and δ is the allowed error. ...
Keywords:
small bias spaces, bounded width branching programs, randomized group product, pseudorandom generators
CCS:
Probabilistic computation
Primary CCS:
Probabilistic computation
Result page:
1
2
3
4
5
6
7
8
9
10
>>
