785 search results - page 87 / 157 » Embedding a Forest in a Graph |
128
click to vote
ECML
2005
Springer
15 years 9 months ago
2005
Springer
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
124
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
142
click to vote
EUROMICRO
1998
IEEE
15 years 8 months ago
1998
IEEE
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
181
Voted
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
154
click to vote
ENTCS
2006
15 years 4 months ago
2006
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...