24 search results - page 4 / 5 » Densification arising from sampling fixed graphs |
COMBINATORICS
2000
13 years 5 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
RSP
2000
IEEE
13 years 10 months ago
2000
IEEE
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
TCSV
2010
13 years 20 days ago
2010
We propose a new distance measure for face recognition and human gait recognition. Each probe image (a face image or an average human silhouette image) is represented as a set of ...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...