Sciweavers

101 search results - page 9 / 21
» Domination Problems in Nowhere-Dense Classes
Sort
View
TIT
2010
114views Education» more  TIT 2010»
13 years 2 months ago
Convergence of min-sum message-passing for convex optimization
Abstract--We establish that the min-sum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems, generalizin...
Ciamac Cyrus Moallemi, Benjamin Van Roy
ICPR
2008
IEEE
14 years 1 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...
IWPEC
2009
Springer
14 years 1 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 7 months ago
Decision Making with Side Information and Unbounded Loss Functions
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
Majid Fozunbal, Ton Kalker
NMR
2004
Springer
14 years 22 days ago
Generalizing the AGM postulates: preliminary results and applications
One of the crucial actions any reasoning system must undertake is the updating of its Knowledge Base (KB). This problem is usually referred to as the problem of belief change. The...
Giorgos Flouris, Dimitris Plexousakis, Grigoris An...