688 search results - page 83 / 138 » General Partitioning on Random Graphs |
103
click to vote
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
99
Voted
CORR
2008
Springer
15 years 18 days ago
2008
Springer
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
127
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
CPC
2006
15 years 17 days ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
108
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...