2314 search results - page 390 / 463 » Minimal Partitions of a Graph |
273
Voted
SCIA
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
117
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
143
Voted
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper addresses the problem of efficient and accurate performance analysis to drive the exploration and design of bus-based System-on-Chip (SOC) communication architectures. ...
145
Voted
SIGADA
1999
Springer
15 years 7 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
162
Voted
PAMI
2010
14 years 10 months ago
2010
In this paper, we present a novel approach to 3D face matching that shows high effectiveness in distinguishing facial differences between distinct individuals from differences indu...