5606 search results - page 247 / 1122 » Randomization Techniques for Graphs. |
158
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
142
click to vote
UAI
2004
15 years 7 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
154
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
199
click to vote
JGAA
2007
15 years 6 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
183
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...