895 search results - page 40 / 179 » Using graphs for some discrete tomography problems |
COMPGEOM
2009
ACM
14 years 5 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
JAIR
2006
13 years 11 months ago
2006
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
MEMBRANE
2004
Springer
14 years 4 months ago
2004
Springer
Some computational aspects and behavioral patterns of P systems are considered, emphasizing dynamical properties that turn useful in characterizing the behavior of biological and b...
FSTTCS
2008
Springer
13 years 12 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
CVPR
2003
IEEE
15 years 28 days ago
2003
IEEE
This paper deals with simultaneous depth map estimation and background separation in a multi-view setting with several fixed calibrated cameras, two problems which have previously...