296 search results - page 11 / 60 » Approximate Discovery of Random Graphs |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
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...
101
click to vote
TCOS
2010
14 years 8 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
106
click to vote
CISS
2007
IEEE
15 years 1 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...
NIPS
2007
14 years 11 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
101
click to vote
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...