94 search results - page 13 / 19 » Instruction selection by graph transformation |
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
KDD
2009
ACM
14 years 3 days ago
2009
ACM
Recent innovations have resulted in a plethora of social applications on the Web, such as blogs, social networks, and community photo and video sharing applications. Such applicat...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
EJC
2010
13 years 7 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
LCTRTS
2005
Springer
14 years 1 months ago
2005
Springer
Efficient implementation of DSP applications is critical for many embedded systems. Optimising C compilers for embedded processors largely focus on code generation and instructio...