1115 search results - page 65 / 223 » Separating Shape Graphs |
91
Voted
ACCV
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...
83
Voted
SLP
1997
15 years 2 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
112
Voted
JDA
2010
14 years 7 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
92
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
Wc optimizc thc noisc shaping bchavior of color crror diffusion by designing an optirnizcd crror filtcr bascd on a proposed noisc shaping modcl for color crror diffusion and a gcn...
199
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...