1594 search results - page 111 / 319 » An Algorithm to Compute Collusion Paths |
140
Voted
LCN
2008
IEEE
15 years 9 months ago
2008
IEEE
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
128
click to vote
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
137
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
210
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation....
178
click to vote
CGIM
2003
15 years 4 months ago
2003
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In ou...