1039 search results - page 82 / 208 » Kernels and Regularization on Graphs |
117
click to vote
APPT
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. In this paper, we propose a universal network, called recursive dual-net (RDN). It can be used as a candidate of effective interconnection networks for massively parallel...
109
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
117
Voted
DIALM
2008
ACM
15 years 2 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
90
Voted
SIAMDM
2008
15 years 18 days ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...