743 search results - page 100 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
157
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
146
click to vote
CISS
2007
IEEE
15 years 6 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
141
Voted
ICDM
2010
IEEE
15 years 4 days ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
145
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...