Sciweavers

494 search results - page 81 / 99
» Heap Building Bounds
Sort
View
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
15 years 2 days ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
CORR
2008
Springer
139views Education» more  CORR 2008»
14 years 10 months ago
Exact two-terminal reliability of some directed networks
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
Christian Tanguy
CGF
2007
165views more  CGF 2007»
14 years 10 months ago
Ray-Casted BlockMaps for Large Urban Models Visualization
We introduce a GPU-friendly technique that efficiently exploits the highly structured nature of urban environments to ensure rendering quality and interactive performance of city...
Paolo Cignoni, Marco Di Benedetto, Fabio Ganovelli...
TON
2008
124views more  TON 2008»
14 years 10 months ago
Designing packet buffers for router linecards
-- Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, whic...
Sundar Iyer, Ramana Rao Kompella, Nick McKeown
CCR
2004
95views more  CCR 2004»
14 years 10 months ago
A Per-Domain Behavior for circuit emulation in IP networks
Circuit networks are expensive to build, difficult to operate, fragile, and not easily scalable. Many network operators would like to carry circuit traffic as an overlay on top of...
Kathleen M. Nichols, Van Jacobson, Kedarnath Podur...