1399 search results - page 125 / 280 » New Algorithms for k-Center and Extensions |
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— This paper considers compression in packet networks. Since data packets may be dropped or arrive reordered, streaming compression algorithms result in a considerable de...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
SI3D
1992
ACM
14 years 1 months ago
1992
ACM
Direct volume rendering is a computationally intensive operation that has become a valued and often preferred visualization tool. For maximal data comprehension, interactive manip...
GECCO
2007
Springer
14 years 26 days ago
2007
Springer
EVITA, standing for Evolutionary Inventory and Transportation Algorithm, aims to be a commercial tool to address the problem of minimising both the transport and inventory costs o...
EGH
2004
Springer
14 years 22 days ago
2004
Springer
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...