1002 search results - page 31 / 201 » Towards Graph Programs for Graph Algorithms |
164
click to vote
ICTAI
2008
IEEE
15 years 8 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
109
click to vote
IH
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents an implementation of the novel watermarking method proposed by Venkatesan, Vazirani, and Sinha in their recent paper A Graph Theoretic Approach to Sof...
116
click to vote
ASE
2004
15 years 1 months ago
2004
Abstract. The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory acce...
105
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
176
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, a novel hierarchical clustering method using link analysis techniques is introduced. The algorithm is formulated as an authority seeking procedure on graphs, which c...