1591 search results - page 27 / 319 » Random lifts of graphs |
106
Voted
CAAN
2007
Springer
15 years 7 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
100
click to vote
CMSB
2006
Springer
15 years 4 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
107
click to vote
SDM
2010
SIAM
15 years 2 months ago
2010
SIAM
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
134
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...