1986 search results - page 219 / 398 » Path Separability of Graphs |
128
click to vote
IAT
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
134
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper, we propose an IPSec implementation on Xilinx Virtex-II Pro FPGA1 . We move the key management and negotiation into software function calls that run on the PowerPC p...
125
click to vote
ESOP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
113
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
143
click to vote
ISAAC
2004
Springer
15 years 7 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...