23 search results - page 2 / 5 » Many-to-Many Graph Matching via Metric Embedding |
OPODIS
2008
13 years 7 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
DAC
2006
ACM
14 years 7 months ago
2006
ACM
Since performance on FPGAs is dominated by the routing architecture rather than wirelength, we propose a new architecture-aware approach to initial FPGA placement that models the ...
GD
2006
Springer
13 years 10 months ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
CVPR
2007
IEEE
14 years 8 months ago
2007
IEEE
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
SIAMDM
2000
13 years 6 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...