Skip to search formSkip to main contentSkip to account menu

Closure problem

In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices with no outgoing edges.That is, the graph should… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Introduction India posted an impressive growth record after economic liberalization in 1991. A slow-down during the world… 
2014
2014
In this paper, we present an algorithm for robot simultaneous localization and mapping (SLAM) using a Kinect sensor, which is a… 
2007
2007
Simultaneous Localization and Mapping in dynamic environments is an open issue in the field of robotics. Traditionally, the… 
2006
2006
The one-way measurement model [1, 2, 3] is a framework for universal quantum computation, in which algorithms are partially… 
2005
2005
To investigate the parameters of the protein design problem that we are exploring in collaboration with biochemists, we have… 
2005
2005
The bene ts of nding trends in large volumes of data has driven to the development of data mining technology for over a decade… 
2002
2002
The goal of this study is to compare the performances of the ensemble Kalman filter and a reduced-rank extended Kalman filter…