966 search results - page 84 / 194 » Small Alliances in Graphs |
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
PAMI
2006
13 years 8 months ago
2006
In this paper, we present a generative sketch model for human hair analysis and synthesis. We treat hair images as 2D piecewisely smooth vector (flow) fields, and thus our represe...
SIGIR
2008
ACM
13 years 8 months ago
2008
ACM
Collections are a fundamental tool for reproducible evaluation of information retrieval techniques. We describe a new method for distributing the document lengths and term counts ...
SIAMCOMP
1998
13 years 8 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...