280 search results - page 37 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
LCPC
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
SMI
2006
IEEE
14 years 1 months ago
2006
IEEE
Databases of 3D shapes have become widespread for a variety of applications, and a key research problem is searching these databases for similar shapes. This paper introduces a me...
SIAMDM
2010
13 years 5 months ago
2010
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
TAPSOFT
1997
Springer
13 years 11 months ago
1997
Springer
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...