We introduce a novel framework for nonrigid feature
matching among multiple sets in a way that takes into consideration
both the feature descriptor and the features spatial
arra...
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
We study the properties of affine rigidity of a (hyper)graph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., only depen...
Steven J. Gortler, Craig Gotsman, Ligang Liu, Dyla...
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
The growing software content in various battery-driven embedded systems has led to significant interest in technologies for energy-efficient embedded software. While lowenergy sof...