1039 search results - page 149 / 208 » Kernels and Regularization on Graphs |
GD
2004
Springer
15 years 5 months ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
GD
1999
Springer
15 years 4 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
113
click to vote
IJWMC
2010
14 years 9 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
128
click to vote
IJON
2010
14 years 10 months ago
2010
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
DAC
2009
ACM
16 years 25 days ago
2009
ACM
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...