401 search results - page 52 / 81 » Sparse Quasi-Random Graphs |
84
Voted
DAM
2007
14 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
86
Voted
SIGCOMM
1992
ACM
15 years 1 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
107
click to vote
CIE
2009
Springer
15 years 1 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...