21 search results - page 1 / 5 » A Graph Reduction Step Preserving Element-Connectivity and A... |
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
IJON
2010
13 years 8 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
TSMC
2010
13 years 5 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
DAC
2009
ACM
14 years 2 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
RTA
2007
Springer
14 years 5 months ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...