Sciweavers

3 search results - page 1 / 1
» Random Tensors and Planted Cliques
Sort
View
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
15 years 4 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala
ECSQARU
2009
Springer
15 years 4 months ago
Triangulation Heuristics for BN2O Networks
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...
Petr Savický, Jirí Vomlel
ICCV
2007
IEEE
15 years 11 months ago
Steerable Random Fields
In contrast to traditional Markov random field (MRF) models, we develop a Steerable Random Field (SRF) in which the field potentials are defined in terms of filter responses that ...
Stefan Roth, Michael J. Black