Sciweavers

688 search results - page 70 / 138
» General Partitioning on Random Graphs
Sort
View
UAI
2004
15 years 1 months ago
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
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 ...
Mathias Drton, Thomas S. Richardson
JGAA
2007
135views more  JGAA 2007»
15 years 12 days ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
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...
Donatello Conte, Pasquale Foggia, Mario Vento
97
Voted
CVPR
2003
IEEE
16 years 2 months ago
Object Segmentation in Videos from Moving Camera with MRFs on Color and Motion Features
In this paper we address the problem of fast segmenting moving objects in video acquired by moving camera or more generally with a moving background. We present an approach based ...
Rita Cucchiara, Andrea Prati, Roberto Vezzani
86
Voted
IPL
2008
89views more  IPL 2008»
15 years 15 days ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
94
Voted
4OR
2007
103views more  4OR 2007»
15 years 19 days ago
Compact linearization for binary quadratic problems
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
Leo Liberti