1629 search results - page 224 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
103
click to vote
ITC
1993
IEEE
15 years 2 months ago
1993
IEEE
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
FPGA
2007
ACM
15 years 4 months ago
2007
ACM
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
153
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
120
click to vote
KDD
2012
ACM
13 years 12 days ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...