54 search results - page 5 / 11 » Flexible pointer analysis using assign-fetch graphs |
LOPSTR
2007
Springer
14 years 1 months ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
TVLSI
2008
13 years 7 months ago
2008
To satisfy the advanced forward-error-correction (FEC) standards, in which the Convolutional code and Turbo code may co-exit, a prototype design of a unified Convolutional/Turbo de...
SIPS
2006
IEEE
14 years 1 months ago
2006
IEEE
—A wide variety of DSP design tools have been developed that incorporate dataflow graph representations into their GUI-based design environments. However, as the complexity of ap...
JACM
2000
13 years 7 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...