2314 search results - page 341 / 463 » Minimal Partitions of a Graph |
186
click to vote
VLSID
2008
IEEE
16 years 6 months ago
2008
IEEE
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
193
click to vote
IWCIA
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
183
click to vote
IROS
2007
IEEE
16 years 20 days ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
186
click to vote
ICCV
2005
IEEE
15 years 12 months ago
2005
IEEE
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
194
click to vote
AAAI
2010
15 years 7 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...