Sciweavers

131 search results - page 13 / 27
» Hypergraphs with independent neighborhoods
Sort
View
STOC
2012
ACM
222views Algorithms» more  STOC 2012»
11 years 10 months ago
An analysis of one-dimensional schelling segregation
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so l...
Christina Brandt, Nicole Immorlica, Gautam Kamath,...
STACS
2010
Springer
14 years 2 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
IWPEC
2009
Springer
14 years 2 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...
SSS
2007
Springer
14 years 1 months ago
Probabilistic Fault-Containment
Research on fine tuning stabilization properties has received attention for nearly a decade. This paper presents a probabilistic algorithm for fault-containment, that confines th...
Anurag Dasgupta, Sukumar Ghosh, Xin Xiao
VMV
2001
209views Visualization» more  VMV 2001»
13 years 9 months ago
A Novel Probabilistic Model for 3D Object Recognition: Spin-Glass Markov Random Fields
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...
Barbara Caputo, Sahla Bouattour, Dietrich Paulus