1493 search results - page 88 / 299 » Local resilience of graphs |
ISCC
2002
IEEE
14 years 23 days ago
2002
IEEE
In this paper we study the performance trade-offs between conventional cellular and ad-hoc peer-to-peer wireless networks. We compare through simulations the performance of the tw...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
CONEXT
2008
ACM
13 years 9 months ago
2008
ACM
Enterprise networks are important, with size and complexity even surpassing carrier networks. Yet, the design of enterprise networks remains ad-hoc and poorly understood. In this p...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract-- Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. Ho...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...