Results 1  10
of
883,704
Codes and Decoding on General Graphs
, 1996
"... Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithm ..."
Abstract

Cited by 359 (1 self)
 Add to MetaCart
codes); the resulting algorithms are in general suboptimal, but significant complexity reductions are possible compared to the cyclefree case. Several performance estimates for iterative decoding are developed, including a generalization of the union bound used with Viterbi decoding and a
Which Codes Have CycleFree
, 1998
"... If a linear block code C of length n has a Tanner graph without cycles, then maximumlikelihood softdecision decoding of C can be achieved in time O(n2). However, we show that cyclefree Tanner graphs cannot support good codes. Specifically, let C be an (n, k, d) linear code of rate R = k/n that ca ..."
Abstract
 Add to MetaCart
If a linear block code C of length n has a Tanner graph without cycles, then maximumlikelihood softdecision decoding of C can be achieved in time O(n2). However, we show that cyclefree Tanner graphs cannot support good codes. Specifically, let C be an (n, k, d) linear code of rate R = k
The Component Fairness Solution for CycleFree
, 2005
"... In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cyclefree communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new singlevalued ..."
Abstract
 Add to MetaCart
In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cyclefree communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new single
A Set Of Principles For Conducting And Evaluating Interpretive Field Studies In Information Systems
, 1999
"... This article discusses the conduct and evaluation of interpretive research in information systems. While the conventions for evaluating information systems case studies conducted according to the natural science model of social science are now widely accepted, this is not the case for interpretive f ..."
Abstract

Cited by 874 (5 self)
 Add to MetaCart
This article discusses the conduct and evaluation of interpretive research in information systems. While the conventions for evaluating information systems case studies conducted according to the natural science model of social science are now widely accepted, this is not the case for interpretive
A Methodology for AgentOriented Analysis and Design
, 1999
"... This paper presents a methodology for agentoriented analysis and design. The methodology is general, in that it is applicable to a wide range of multiagent systems, and comprehensive, in that it deals with both the macrolevel (societal) and the microlevel (agent) aspects of systems. The methodol ..."
Abstract

Cited by 812 (12 self)
 Add to MetaCart
. The methodology is founded on the view of a system as a computational organisation consisting of various interacting roles. We illustrate the methodology through a case study (an agentbased business process management system).
Eraser: a dynamic data race detector for multithreaded programs
 ACM Transaction of Computer System
, 1997
"... Multithreaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This paper describes a new tool, called Eraser, for dynamically detecting data races in lockbased ..."
Abstract

Cited by 687 (2 self)
 Add to MetaCart
based multithreaded programs. Eraser uses binary rewriting techniques to monitor every shared memory reference and verify that consistent locking behavior is observed. We present several case studies, including undergraduate coursework and a multithreaded Web search engine, that demonstrate
ChernSimons Gauge Theory as a String Theory
, 2003
"... Certain two dimensional topological field theories can be interpreted as string theory backgrounds in which the usual decoupling of ghosts and matter does not hold. Like ordinary string models, these can sometimes be given spacetime interpretations. For instance, threedimensional ChernSimons gaug ..."
Abstract

Cited by 551 (14 self)
 Add to MetaCart
Simons gauge theory can arise as a string theory. The worldsheet model in this case involves a topological sigma model. Instanton contributions to the sigma model give rise to Wilson line insertions in the spacetime ChernSimons theory. A certain holomorphic analog of ChernSimons theory can also arise as a
Numerical solution of initial boundary value problems involving Maxwell’s equations in isotropic media
 IEEE Trans. Antennas and Propagation
, 1966
"... The characteristics of the waves guided along a plane [I] P. S. Epstein, “On the possibility of electromagnetic surface waves, ” Proc. Nat’l dcad. Sciences, vol. 40, pp. 11581165, Deinterface which separates a semiinfinite region of free cember 1954. space from that of a magnetoionic medium are in ..."
Abstract

Cited by 1009 (0 self)
 Add to MetaCart
The characteristics of the waves guided along a plane [I] P. S. Epstein, “On the possibility of electromagnetic surface waves, ” Proc. Nat’l dcad. Sciences, vol. 40, pp. 11581165, Deinterface which separates a semiinfinite region of free cember 1954. space from that of a magnetoionic medium
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple computational rule, the sumproduct algorithm operates in factor graphs to computeeither exactly or approximatelyvarious marginal functions by distributed messagepassing in the graph. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can be derived as specific instances of the sumproduct algorithm, including the forward/backward algorithm, the Viterbi algorithm, the iterative "turbo" decoding algorithm, Pearl's belief propagation algorithm for Bayesian networks, the Kalman filter, and certain fast Fourier transform algorithms.
Results 1  10
of
883,704