1002 search results - page 110 / 201 » Towards Graph Programs for Graph Algorithms |
138
Voted
ICSE
2004
IEEE-ACM
16 years 2 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
147
Voted
DAC
2007
ACM
16 years 3 months ago
2007
ACM
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
146
Voted
ISPD
2007
ACM
15 years 4 months ago
2007
ACM
When VLSI technology scales toward 45nm, the lithography wavelength stays at 193nm. This large gap results in strong refractive effects in lithography. Consequently, it is a huge...
130
click to vote
MP
2006
15 years 2 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
140
click to vote
PPOPP
2006
ACM
15 years 8 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...