1067 search results - page 142 / 214 » Probabilistic regular graphs |
110
Voted
MOBIHOC
2008
ACM
16 years 5 days ago
2008
ACM
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
SMA
2005
ACM
15 years 6 months ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
99
Voted
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
NIPS
2004
15 years 1 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
105
click to vote
NIPS
2001
15 years 1 months ago
2001
This paper presents an unsupervised learning algorithm that can derive the probabilistic dependence structure of parts of an object (a moving human body in our examples) automatic...