2125 search results - page 163 / 425 » On Graph Complexity |
CC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
The examination of straightforwardly definable discrete structures in nucleic acids and proteins turned out to be perhaps the most important development in our present knowledge a...
96
Voted
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
76
Voted
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
102
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...