1594 search results - page 77 / 319 » An Algorithm to Compute Collusion Paths |
127
click to vote
PODC
2006
ACM
15 years 9 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
120
click to vote
TON
2010
15 years 1 months ago
2010
Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two ...
113
click to vote
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper presents a new method for segmenting and recognizing Chinese handwritten address character strings. First, a dissection algorithm is applied to over-segment string imag...
125
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
154
click to vote
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...