2695 search results - page 373 / 539 » Learning Graph Matching |
138
click to vote
COMPLEX
2009
Springer
15 years 7 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
103
click to vote
STACS
2000
Springer
15 years 6 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
122
click to vote
WADS
1995
Springer
15 years 6 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
110
click to vote
AAAI
2007
15 years 5 months ago
2007
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a Reprod...
139
Voted
ASAP
2008
IEEE
15 years 5 months ago
2008
IEEE
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...