Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,002
Loopy belief propagation for approximate inference: An empirical study. In:
- Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract
-
Cited by 676 (15 self)
- Add to MetaCart
Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon
Reasoning about Infinite Computations
- Information and Computation
, 1994
"... We investigate extensions of temporal logic by connectives defined by finite automata on infinite words. We consider three different logics, corresponding to three different types of acceptance conditions (finite, looping and repeating) for the automata. It turns out, however, that these logics all ..."
Abstract
-
Cited by 315 (58 self)
- Add to MetaCart
We investigate extensions of temporal logic by connectives defined by finite automata on infinite words. We consider three different logics, corresponding to three different types of acceptance conditions (finite, looping and repeating) for the automata. It turns out, however, that these logics all
Dataflow Analysis of Array and Scalar References
- International Journal of Parallel Programming
, 1991
"... Given a program written in a simple imperative language (assignment statements, for loops, affine indices and loop limits), this paper presents an algorithm for analyzing the patterns along which values flow as the execution proceeds. For each array or scalar reference, the result is the name an ..."
Abstract
-
Cited by 254 (3 self)
- Add to MetaCart
construction. Keywords dataflow analysis, semantics analysis, array expansion. 1 Introduction It is a well known fact that scientific programs spend most of their running time in executing loops operating on arrays. Hence if a restructuring or optimizing compiler is to do a good job, it must be able to do a
Background independent quantum gravity: a status report
, 2004
"... The goal of this article is to present an introduction to loop quantum gravity —a background independent, non-perturbative approach to the problem of unification of general relativity and quantum physics, based on a quantum theory of geometry. Our presentation is pedagogical. Thus, in addition to pr ..."
Abstract
-
Cited by 259 (7 self)
- Add to MetaCart
The goal of this article is to present an introduction to loop quantum gravity —a background independent, non-perturbative approach to the problem of unification of general relativity and quantum physics, based on a quantum theory of geometry. Our presentation is pedagogical. Thus, in addition
Improving Register Allocation for Subscripted Variables
, 1990
"... INTRODUCTION By the late 1980s, memory system performance and CPU performance had already begun to diverge. This trend made effective use of the register file imperative for excellent performance. Although most compilers at that time allocated scalar variables to registers using graph coloring with ..."
Abstract
-
Cited by 225 (35 self)
- Add to MetaCart
INTRODUCTION By the late 1980s, memory system performance and CPU performance had already begun to diverge. This trend made effective use of the register file imperative for excellent performance. Although most compilers at that time allocated scalar variables to registers using graph coloring
Re-engineering Norwegian Research Libraries
"... Abstract. The Norwegian shared library system BIBSYS is in 2010 used by more than hundred university-, college-, and research libraries, including the Norwegian National Library. The BIBSYS project was initiated in 1970 and it led to a complete re-engineering of the Norwegian research libraries. Th ..."
Abstract
- Add to MetaCart
Abstract. The Norwegian shared library system BIBSYS is in 2010 used by more than hundred university-, college-, and research libraries, including the Norwegian National Library. The BIBSYS project was initiated in 1970 and it led to a complete re-engineering of the Norwegian research libraries
An Equational Re-Engineering of Set Theories
- Automated Deduction in Classical and Non-Classical Logics, LNCS 1761 (LNAI
, 1998
"... New successes in dealing with set theories by means of state-of-the-art theoremprovers may ensue from terse and concise axiomatizations, such as can be moulded in the framework of the (fully equational) Tarski-Givant map calculus. In this paper we carry out this task in detail, setting the ground fo ..."
Abstract
-
Cited by 7 (6 self)
- Add to MetaCart
for a number of experiments. Key words: Set theory, relation algebras, first-order theorem-proving, algebraic logic. 1 Introduction Like other mature fields of mathematics, Set Theory deserves sustained efforts that bring to light richer and richer decidable fragments of it [5], general inference
FOR SOFTWARE RE-ENGINEERING AND PROGRAM ANALYSIS.
"... The object oriented software developers now admit that thinking about object-oriented program understanding and comprehension to be relatively easier is not that easy. Programs are even more complex and difficult to comprehend, unless rigorously documented. What if the documentation is improper? To ..."
Abstract
- Add to MetaCart
. It also infers about the efficiency of some java reverse engineering tools and sufficiency of static analysis over runtime dynamic analysis for revelation of code structure from bytecode. Keywords: Reverse engineering; Re-engineering; Program analysis; bytecode analysis. 1. Introduction: Object
Results 1 - 10
of
4,002
