2612 search results - page 112 / 523 » Switching Graphs and Their Complexity |
TAPSOFT
1997
Springer
15 years 2 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...
CSC
2008
14 years 11 months ago
2008
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...
IPL
2006
14 years 10 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
ISBI
2006
IEEE
15 years 10 months ago
2006
IEEE
Tagged Magnetic Resonance Imaging (MRI) is currently the reference MR modality for myocardial motion and strain analysis. Mutual Information (MI) based non rigid registration has ...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...