Results 1  10
of
2,775
The Serial Transitive Closure Problem for Trees
, 2002
"... The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G . We give a nearly linear upper bound on the number of steps in optimal ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G . We give a nearly linear upper bound on the number of steps
The Serial Transitive Closure Problem for Trees
, 2002
"... Abstract The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G. We give a nearly linear upper bound on the number of steps in opt ..."
Abstract
 Add to MetaCart
Abstract The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G. We give a nearly linear upper bound on the number of steps
Sequential data assimilation with a nonlinear quasigeostrophic model using Monte Carlo methods to forecast error statistics
 J. Geophys. Res
, 1994
"... . A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter. The ..."
Abstract

Cited by 800 (23 self)
 Add to MetaCart
covariance equation are avoided because storage and evolution of the error covariance matrix itself are not needed. The results are also better than what is provided by the extended Kalman filter since there is no closure problem and the quality of the forecast error statistics therefore improves. The method
Hardness of the Maximum UnionofClosures Problem
, 2009
"... The maximum closure problem of a vertexweighted directed graph is a classical optimization problem. Motivated by image segmentation and data mining applications, we consider a variant that computes the maximum union of closures of two different graphs on a shared vertex set. We show that the proble ..."
Abstract
 Add to MetaCart
The maximum closure problem of a vertexweighted directed graph is a classical optimization problem. Motivated by image segmentation and data mining applications, we consider a variant that computes the maximum union of closures of two different graphs on a shared vertex set. We show
Beyond Market Baskets: Generalizing Association Rules To Dependence Rules
, 1998
"... One of the more wellstudied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: “A customer purchasing item A often also purchases item B. Motivated partly by the goal of generalizing beyond market bask ..."
Abstract

Cited by 634 (6 self)
 Add to MetaCart
squared test for independence from classical statistics. This leads to a measure that is upwardclosed in the itemset lattice, enabling us to reduce the mining problem to the search for a border between dependent and independent itemsets in the lattice. We develop pruning strategies based on the closure
Addressing the Timing Closure Problem by Integrating Logic Optimization and Placement
 Proc. ICCAD‘01
, 2001
"... Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation, logic synthesis and layout synthesis are iterated until the estimates match. The number of such iterations is becoming ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation, logic synthesis and layout synthesis are iterated until the estimates match. The number of such iterations is becoming
Slopes of vector bundles on projective curves and applications to tight closure problems
 Trans. Am. Math. Soc
"... Abstract. We study different notions of slope of a vector bundle over a smooth projective curve with respect to ampleness and affineness in order to apply this to tight closure problems. This method gives new degree estimates from above and from below for the tight closure of a homogeneous R+primar ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We study different notions of slope of a vector bundle over a smooth projective curve with respect to ampleness and affineness in order to apply this to tight closure problems. This method gives new degree estimates from above and from below for the tight closure of a homogeneous R
Discovering Frequent Closed Itemsets for Association Rules
, 1999
"... In this paper, we address the problem of finding frequent itemsets in a database. Using the closed itemset lattice framework, we show that this problem can be reduced to the problem of finding frequent closed itemsets. Based on this statement, we can construct efficient data mining algorithms by lim ..."
Abstract

Cited by 410 (14 self)
 Add to MetaCart
In this paper, we address the problem of finding frequent itemsets in a database. Using the closed itemset lattice framework, we show that this problem can be reduced to the problem of finding frequent closed itemsets. Based on this statement, we can construct efficient data mining algorithms
Curvegraph odometry: Orientationfree error parameterisations for loop closure problems
, 2015
"... During incremental odometry estimation in robotics and vision applications, the accumulation of estimation error produces a drift in the trajectory. This drift becomes observable when returning to previously visited areas, where it is possible to correct it by applying loop closing techniques. Ulti ..."
Abstract
 Add to MetaCart
the stateoftheart pose graph optimisation scheme on the manifold of the rigid body motions. In this paper we propose to address the loop closure problem using only the positions and thus removing the orientations from the optimisation vector. The novelty in our approach is that, instead of treating
DOUGLAS WALTON ACTIONS AND INCONSISTENCY: THE CLOSURE PROBLEM OF PRACTICAL REASONING
"... This article formulates a fundamental problem in the philosophy of action. It will become apparent that the same problem is also an abstract and general, but very important question for the field of artificial intelligence and robotics in particular. As well, the nature of the problem, as revealed ..."
Abstract
 Add to MetaCart
This article formulates a fundamental problem in the philosophy of action. It will become apparent that the same problem is also an abstract and general, but very important question for the field of artificial intelligence and robotics in particular. As well, the nature of the problem, as revealed
Results 1  10
of
2,775