371 search results - page 16 / 75 » Algorithms for the transportation problem in geometric setti... |
ENDM
2008
13 years 7 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
IJCV
2007
13 years 7 months ago
2007
Abstract. We address the problem of finding the correspondences of two point sets in 3D undergoing a rigid transformation. Using these correspondences the motion between the two s...
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
AAAI
2012
11 years 10 months ago
2012
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
EOR
2006
13 years 7 months ago
2006
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...