76 search results - page 3 / 16 » Dominance Order and Graphical Partitions |
UAI
2001
13 years 7 months ago
2001
We propose a directed graphical representation of utility functions, called UCP-networks, that combines aspects of two existing preference models: generalized additive models and ...
IWVF
2001
Springer
13 years 10 months ago
2001
Springer
A method for partitioning shapes is described based on a global convexity measure. Its advantages are that its global nature makes it robust to noise, and apart from the number of ...
NIPS
2000
13 years 7 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
UAI
2003
13 years 7 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
DM
2008
13 years 6 months ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...