Sciweavers

127 search results - page 10 / 26
» Acyclic dominating partitions
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Beyond partitions: Allowing overlapping groups in pairwise clustering
The field of pairwise clustering is currently dominated by the idea of dividing a set of objects into disjoints classes, thereby giving rise to (hard) partitions of the input dat...
Andrea Torsello, Samuel Rota Bulò, Marcello...
CORR
2012
Springer
214views Education» more  CORR 2012»
12 years 3 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos
CCCG
2010
13 years 9 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
ICMCS
2007
IEEE
125views Multimedia» more  ICMCS 2007»
14 years 1 months ago
A Framework for Provisioning Overlay Network Based Multimedia Distribution Services
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
CVPR
2009
IEEE
15 years 2 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...