Results 1  10
of
191,849
Undirected STConnectivity in LogSpace
, 2004
"... We present a deterministic, logspace algorithm that solves stconnectivity in undirected graphs. The previous bound on the space complexity of undirected stconnectivity was log 4/3 (·) obtained by Armoni, TaShma, Wigderson and Zhou [ATSWZ00]. As undirected stconnectivity is complete for the clas ..."
Abstract

Cited by 166 (3 self)
 Add to MetaCart
We present a deterministic, logspace algorithm that solves stconnectivity in undirected graphs. The previous bound on the space complexity of undirected stconnectivity was log 4/3 (·) obtained by Armoni, TaShma, Wigderson and Zhou [ATSWZ00]. As undirected stconnectivity is complete
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
On the Complexity of the stConnectivity Problem
, 1996
"... The directed stconnectivity problem is fundamental to computer science. There are many applications which require algorithms to solve the problem in small space and preferably in small time as well. Furthermore, its space and timespace complexities are related to several longstanding open probl ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
The directed stconnectivity problem is fundamental to computer science. There are many applications which require algorithms to solve the problem in small space and preferably in small time as well. Furthermore, its space and timespace complexities are related to several longstanding open
TimeSpace Lower Bounds for Undirected and Directed STConnectivity on JAG Models
, 1993
"... Directed and undirected stconnectivity are important problems in computing. There are algorithms for the undirected case that use O (n) time and algorithms that use O (log n) space. The first result of this thesis proves that, in a very natural structured model, the JAG (Jumping Automata for Graph ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Directed and undirected stconnectivity are important problems in computing. There are algorithms for the undirected case that use O (n) time and algorithms that use O (log n) space. The first result of this thesis proves that, in a very natural structured model, the JAG (Jumping Automata
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2837 (11 self)
 Add to MetaCart
;enyi's nonmonotone result [Imm88, Sze87] that NL = coNL; this is a simple extension of the monotone circuit depth lower bound of Karchmer and Wigderson [KW90] for stconnectivity. We also consider mBWBP (monotone bounded width branching programs) and study the question of whether mBWBP is properly contained
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
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
TimeSpace TradeOffs For Undirected STConnectivity on a JAG
"... The following is a second proof of (basically) the same undirected stconnectivity result using recursive flyswatters as given in my thesis and in STOC93 [Ed93a, EdPHD]. The input graph and the reduction techniques in the two proofs are similar. The main difference is that JAG result is reduced to ..."
Abstract
 Add to MetaCart
The following is a second proof of (basically) the same undirected stconnectivity result using recursive flyswatters as given in my thesis and in STOC93 [Ed93a, EdPHD]. The input graph and the reduction techniques in the two proofs are similar. The main difference is that JAG result is reduced
Boosting a Weak Learning Algorithm By Majority
, 1995
"... We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas pr ..."
Abstract

Cited by 516 (15 self)
 Add to MetaCart
We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas
Results 1  10
of
191,849