906 search results - page 109 / 182 » Map graphs |
131
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
102
Voted
KES
2007
Springer
15 years 8 months ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
122
Voted
ICDM
2005
IEEE
15 years 8 months ago
2005
IEEE
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
130
Voted
ICN
2009
Springer
15 years 7 months ago
2009
Springer
—Ever since Descartes introduced planar coordinate systems, visual representations of data have become a widely accepted way of describing scientific phenomena. Modern advances ...
113
Voted
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...