1940 search results - page 168 / 388 » Graph Transformation with Variables |
126
Voted
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
120
Voted
ENTCS
2007
15 years 3 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
143
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
145
Voted
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape a...
131
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...