195 search results - page 19 / 39 » A Riemannian approach to graph embedding |
GD
1998
Springer
13 years 12 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we present a system for the temporal segmentation, summarization, and browsing of the Echocardiogram videos. Echocardiogram videos are video sequences produced by t...
GG
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Code generators are widely used in the development of embedded software to automatically generate executable code from graphical specifications. However, at present, cod...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
IJON
2006
13 years 7 months ago
2006
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...