1591 search results - page 193 / 319 » Random lifts of graphs |
149
click to vote
RSA
2010
15 years 4 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
172
click to vote
ALT
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
198
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
138
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
166
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...