713 search results - page 37 / 143 » Laplacian mesh optimization |
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
COST
2009
Springer
14 years 3 months ago
2009
Springer
In transparent optical networks as the signal propagates through a transparent network it experiences the impact of a variety of quality degrading phenomena that are introduced by ...
NETCOOP
2007
Springer
14 years 2 months ago
2007
Springer
In the networking research literature, the problem of network utility optimization is often converted to the dual problem which, due to nondifferentiability, is solved with a part...
ISCA
2005
IEEE
14 years 2 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
AMDO
2010
Springer
13 years 6 months ago
2010
Springer
This paper proposes a method of rate-distortion optimisation of an algorithm for compressing dynamic 3D triangle meshes. Although many articles regarding compression methods for th...