Results 1  10
of
1,135
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 errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit 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 errorcorrecting codes. The most dramatic instance of this is the near Shannon
Average Case Analysis of Moore’s State Minimization Algorithm
, 2009
"... We prove that for the uniform distribution over accessible deterministic automata with n states, the average complexity of Moore’s state minimization algorithm is in O(nlog n). The bound is shown to be tight in the case of unary automata. The average complexity of this algorithm for other related d ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove that for the uniform distribution over accessible deterministic automata with n states, the average complexity of Moore’s state minimization algorithm is in O(nlog n). The bound is shown to be tight in the case of unary automata. The average complexity of this algorithm for other related
ON THE AVERAGE COMPLEXITY OF MOORE’S STATE MINIMIZATION ALGORITHM
, 2009
"... We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore’s state minimization algorithm is in O(nlog n). Moreover this bound is tight in the case of unary automata. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore’s state minimization algorithm is in O(nlog n). Moreover this bound is tight in the case of unary automata.
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
shape criterion is weaker in favor of the SNR. With both strategies the reconstruction algorithm is numerically demanding in the general case. This is mainly because with hybrid encoding the bulk of the work of reconstruction can usually not be done by fast Fourier transform (FFT). However, it is shown
Average Case Analysis of Marking Algorithms
, 1986
"... . The Lindstrom marking algorithm uses bounded workspace. Its time complexity is O(n 2 ) in all cases, but it has been assumed that the average case time complexity is O(n lg n). It is proven that the average case time complexity is Q(n 2 ). Similarly, the average size of the Wegbreit bit stack ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of California, Irvine, CA 92717. # Department of Computer Science, California State University, Dominguez Hills, CA 94707. Average Case Analysis of Marking Algorithms D.S. Hirschberg + and L.L. Larmore # University of California, Irvine California State University, Dominguez Hills 1. Introduction
Constrained Markov Decision Processes
, 1995
"... This report presents a unified approach for the study of constrained Markov decision processes with a countable state space and unbounded costs. We consider a single controller having several objectives; it is desirable to design a controller that minimize one of cost objective, subject to inequalit ..."
Abstract

Cited by 165 (11 self)
 Add to MetaCart
This report presents a unified approach for the study of constrained Markov decision processes with a countable state space and unbounded costs. We consider a single controller having several objectives; it is desirable to design a controller that minimize one of cost objective, subject
Selfdetermination and persistence in a reallife setting: Toward a motivational model of high school dropout.
 Journal of Personality and Social Psychology,
, 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract

Cited by 183 (19 self)
 Add to MetaCart
Manpower and Immigration, 1990) and in the United States A survey of research on high school dropout reveals that one factor in a student's decision to drop out of school may be motivation (see Preparation of this article was facilitated through a grant and a doctoral fellowship from the Social
Average Case and Smoothed Competitive Analysis of the . . .
, 2003
"... In this paper we introduce the notion of smoothed competitive analysis of online algorithms. Smoothed analysis has been proposed by Spielman and Teng [23] to explain the behaviour of algorithms that work well in practice while performing very poorly from a worst case analysis point of view. We apply ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
In this paper we introduce the notion of smoothed competitive analysis of online algorithms. Smoothed analysis has been proposed by Spielman and Teng [23] to explain the behaviour of algorithms that work well in practice while performing very poorly from a worst case analysis point of view. We
On the performance of automata minimization algorithms
 DCC  FC & LIACC, UNIVERSIDADE DO PORTO
, 2007
"... Apart from the theoretical worstcase running time analysis not much is known about the averagecase analysis or practical performance of finite automata minimization algorithms. On this paper we compare the running time of four minimization algorithms based on experimental results. We applied thes ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Apart from the theoretical worstcase running time analysis not much is known about the averagecase analysis or practical performance of finite automata minimization algorithms. On this paper we compare the running time of four minimization algorithms based on experimental results. We applied
On the complexity of searching in trees: Averagecase minimization
, 2009
"... We study the following tree search problem: in a given tree T = (V, E) a node has been marked and we want to identify it. In order to locate the marked node, we can use edge queries. An edge query e asks in which of the two connected components of T \ e the marked node lies. The worstcase scenario ..."
Abstract
 Add to MetaCart
where one is interested in minimizing the maximum number of queries is well understood, and linear time algorithms are known for finding an optimal search strategy [Onak et al. FOCS’06, Mozes et al. SODA’08]. Here we study the more involved averagecase analysis: A function w: V → Z + is given which
Results 1  10
of
1,135