1399 search results - page 58 / 280 » New Algorithms for k-Center and Extensions |
SPAA
1994
ACM
14 years 1 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
ESAS
2006
Springer
14 years 25 days ago
2006
Springer
We investigate the performance of of several protocol enhancements to the On-Demand Secure Byzantine Routing (ODSBR) [3] protocol in the presence of various Byzantine Attack models...
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
— Service composition enables flexible creation of new services by assembling independent service components. We are focused on the scenario where such composition takes place a...
CGI
2003
IEEE
14 years 2 months ago
2003
IEEE
We present a new fast algorithm for rendering the depthof-field effect for point-based surfaces. The algorithm handles partial occlusion correctly, it does not suffer from intens...
ALGORITHMICA
2004
13 years 9 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...