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...
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition,...
Emerging scale-out workloads require extensive amounts of computational resources. However, data centers using modern server hardware face physical constraints in space and power,...
Michael Ferdman, Almutaz Adileh, Yusuf Onur Ko&cce...
In this paper, an efficient global algorithm for vectorizing line drawings is presented. It first extracts a seed segment of a graphic entity from a raster image to obtain its dir...
Jiqiang Song, Feng Su, Jibing Chen, Chiew-Lan Tai,...
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...