1594 search results - page 62 / 319 » An Algorithm to Compute Collusion Paths |
PAM
2005
Springer
15 years 5 months ago
2005
Springer
We propose a practical technique for the identification of lossy network links from end-to-end measurements. Our scheme is based on a function that computes the likelihood of each...
TON
2008
14 years 11 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
GRAPHICSINTERFACE
2007
15 years 1 months ago
2007
We introduce a point-based algorithm for computing and rendering stream surfaces and path surfaces of a 3D flow. The points are generated by particle tracing, and an even distrib...
101
click to vote
DAC
2008
ACM
16 years 25 days ago
2008
ACM
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...
IEEEPACT
2006
IEEE
15 years 5 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...