We say a probability distribution μ is spectrally independent if an associated pairwise
influence matrix has a bounded largest eigenvalue for the distribution and all of its …

'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …

In this paper we describe a method that estimates the motion of a calibrated camera (settled
on an experimental vehicle) and the tridimensional geometry of the environment. The only …

Given a set N with n elements and a family F of subsets, we show how to partition N into k
such subsets in 2^nn^O(1) time. We also consider variations of this problem where the …

Complexity theory is built fundamentally on the notion of efficient reduction among
computational problems. Classical reductions involve gadgets that map solution fragments …

The problem of counting homomorphisms from a general graph G to a fixed graph H is a
natural generalization of graph coloring, with important applications in statistical physics …

Mining maximal frequent itemsets is one of the most fundamental problems in data mining.
In this paper we study the complexity-theoretic aspects of maximal frequent itemset mining …

The Counting Constraint Satisfaction Problem (# CSP (H)) over a finite relational structure H
can be expressed as follows: given a relational structure G over the same vocabulary …

It is well-known that inference in graphical models is hard in the worst case, but tractable for
models with bounded treewidth. We ask whether treewidth is the only structural criterion of …

Random independent sets in graphs arise, for example, in statistical physics, in the hardcore
model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for …