1594 search results - page 122 / 319 » An Algorithm to Compute Collusion Paths |
113
click to vote
ICNP
2005
IEEE
15 years 8 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
144
click to vote
PERCOM
2007
ACM
15 years 9 months ago
2007
ACM
A substantial amount of research on routing in sensor networks has focused upon methods for constructing the best route, or routes, from data source to sink before sending the dat...
126
click to vote
OPODIS
2007
15 years 4 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
108
Voted
BROADNETS
2007
IEEE
15 years 9 months ago
2007
IEEE
—Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and reso...
106
click to vote
SIBGRAPI
2000
IEEE
15 years 7 months ago
2000
IEEE
This article deals with a new segmentation approach applied to unconstrained handwritten digits. The novelty of the proposed algorithm is based on the combination of two types of s...