488 search results - page 77 / 98 » Automorphic Decompositions of Graphs |
AFP
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
FCT
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
ISCSCT
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
ISCAPDCS
2004
13 years 9 months ago
2004
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...