Sciweavers

949 search results - page 103 / 190
» On Topological Consistency and Realization
Sort
View
COMPGEOM
2010
ACM
14 years 3 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
INFOCOM
1993
IEEE
14 years 2 months ago
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
Abhay K. Parekh, Robert G. Gallager
SIGCOMM
2010
ACM
13 years 10 months ago
Greening backbone networks: reducing energy consumption by shutting off cables in bundled links
In backbone networks, the line cards that drive the links between neighboring routers consume a large amount of energy. Since these networks are typically overprovisioned, selecti...
Will Fisher, Martin Suchara, Jennifer Rexford
CGF
2005
311views more  CGF 2005»
13 years 10 months ago
Cubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data
In this paper, we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively witho...
Chien-Chang Ho, Fu-Che Wu, Bing-Yu Chen, Yung-Yu C...
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 10 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...