2479 search results - page 136 / 496 » Random Event Structures |
142
click to vote
AAAI
2011
14 years 5 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
147
click to vote
CORR
2012
Springer
14 years 23 days ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
156
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
224
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
144
click to vote
DIMVA
2008
15 years 6 months ago
2008
Over the past several years, US-CERT advisories, as well as most critical updates from software vendors, have been due to memory corruption vulnerabilities such as buffer overflo...